Longest Common Subsequence



A simple way of finding the longest increasing subsequence is to use the Longest Common Subsequence (Dynamic Programming) algorithm.



1. Make a sorted copy of the sequence A, denoted as B. O(nlog(n)) time.

2. Use Longest Common Subsequence on with A and B. O(n2) time. - Longest Common Subsequence



A simple way of finding the longest increasing subsequence is to use the Longest Common Subsequence (Dynamic Programming) algorithm.



　 1. Make a sorted copy of the sequence A, denoted as B. O(nlog(n)) time.

　 2. Use Longest Common Subsequence on with A and B. O(n2) time.