{"id":25350,"date":"2017-10-15T17:10:35","date_gmt":"2017-10-15T11:40:35","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25350"},"modified":"2018-10-31T16:26:46","modified_gmt":"2018-10-31T10:56:46","slug":"python-programming-longest-increasing-subsequence","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-programming-longest-increasing-subsequence\/","title":{"rendered":"Longest Increasing Subsequence"},"content":{"rendered":"

Longest Increasing Subsequence:<\/strong><\/span><\/p>\n

We have discussed Overlapping Subproblems<\/a> and Optimal Substructure<\/a> properties respectively.<\/span><\/p>\n

Let us discuss Longest Increasing Subsequence<\/strong> (LIS) problem as an example problem that can be solved using Dynamic Programming<\/a>.
\nThe Longest Increasing Subsequence (LIS<\/strong>) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted<\/a> in increasing order. For example<\/strong>, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6 and LIS is {10, 22, 33, 50, 60, 80}<\/p>\n

\"Longest-Increasing-Subsequence\"<\/p>\n

More Examples:<\/strong><\/span><\/p>\n

Input  : arr[] = {3, 10, 2, 1, 20}\r\nOutput : Length of LIS = 3\r\nThe longest increasing subsequence is 3, 10, 20\r\n\r\nInput  : arr[] = {3, 2}\r\nOutput : Length of LIS = 1\r\nThe longest increasing subsequences are {3} and {2}\r\n\r\nInput : arr[] = {50, 3, 10, 7, 40, 80}\r\nOutput : Length of LIS = 4\r\nThe longest increasing subsequence is {3, 7, 40, 80}<\/pre>\n[ad type=”banner”]\n
Optimal Substructure:<\/strong><\/span><\/h3>\n
Let arr[0..n-1]<\/strong> be the input array<\/a> and L(i) be the length of the LIS ending at index i such that arr[i] is the last element of the LIS.
\nThen, L(i) can be recursively written as:
\nL(i) = 1 + max( L(j) )<\/strong> where 0 < j < i and arr[j] < arr[i]; or
\nL(i) = 1<\/strong>, if no such j exists.
\nTo find the LIS for a given array, we need to return max(L(i))<\/strong> where 0 < i < n.
\nThus, we see the LIS problem satisfies the optimal substructure property as the main problem can be solved using solutions to subproblems.<\/p>\n
Following is a simple recursive implementation of the LIS problem. It follows the recursive structure discussed above.<\/p>\n
Python Programming<\/strong><\/span><\/p>\n
 
 Python<\/span> <\/div> 
# A naive Python based recursive implementation of LIS problem global max_lis_length # stores the final LIS # Recursive implementation for calculating the LISdef _lis(arr, n):    # Following declaration is needed to allow modification    # of the global copy of max_lis_length in _lis()    global max_lis_length     # Base Case    if n == 1:        return 1     current_lis_length = 1     for i in xrange(0, n-1):        # Recursively calculate the length of the LIS        # ending at arr[i]        subproblem_lis_length = _lis(arr, i)         # Check if appending arr[n-1] to the LIS        # ending at arr[i] gives us an LIS ending at        # arr[n-1] which is longer than the previously        # calculated LIS ending at arr[n-1]        if arr[i] < arr[n-1] and \\            current_lis_length < (1+subproblem_lis_length):            current_lis_length = (1+subproblem_lis_length)     # Check if currently calculated LIS ending at    # arr[n-1] is longer than the previously calculated    # LIS and update max_lis_length accordingly    if (max_lis_length < current_lis_length):        max_lis_length = current_lis_length     return current_lis_length # The wrapper function for _lis()def lis(arr, n):     # Following declaration is needed to allow modification    # of the global copy of max_lis_length in lis()    global max_lis_length     max_lis_length = 1 # stores the final LIS     # max_lis_length is declared global at the top    # so that it can maintain its value    # between the recursive calls of _lis()    _lis(arr , n)     return max_lis_length # Driver program to test the functions abovedef main():    arr = [10, 22, 9, 33, 21, 50, 41, 60]    n = len(arr)    print "Length of LIS is", lis(arr, n) if __name__=="__main__":    main()<\/code><\/pre> <\/div>\n
Output :<\/strong><\/span><\/h3>\n
Length of LIS is 5<\/pre>\n
Overlapping Subproblems :<\/strong><\/span><\/h3>\n
Considering the above implementation, following is recursion tree for an array of size 4. lis(n)<\/strong> gives us the length of LIS for arr[].<\/p>\n
              lis(4)\r\n        \/        |     \\\r\n      lis(3)    lis(2)   lis(1)\r\n     \/   \\        \/\r\n   lis(2) lis(1) lis(1)\r\n   \/\r\nlis(1)\r\n<\/pre>\n
We can see that there are many subproblems which are solved again and again. So this problem has Overlapping Substructure property and recomputation of same subproblems can be avoided by either using Memorization or Tabulation. Following is a tabluated implementation for the LIS problem.<\/p>\n[ad type=”banner”]\n
Python\u00a0Programming<\/strong><\/span><\/p>\n
 
 Python<\/span> <\/div> 
# Dynamic programming Python implementation of LIS problem # lis returns length of the longest increasing subsequence# in arr of size ndef lis(arr):    n = len(arr)     # Declare the list (array) for LIS and initialize LIS    # values for all indexes    lis = [1]*n     # Compute optimized LIS values in bottom up manner    for i in range (1 , n):        for j in range(0 , i):            if arr[i] > arr[j] and lis[i]< lis[j] + 1 :                lis[i] = lis[j]+1     # Initialize maximum to 0 to get the maximum of all    # LIS    maximum = 0     # Pick maximum of all LIS values    for i in range(n):        maximum = max(maximum , lis[i])     return maximum# end of lis function # Driver program to test above functionarr = [10, 22, 9, 33, 21, 50, 41, 60]print "Length of lis is", lis(arr)<\/code><\/pre> <\/div>\n
Output :<\/strong><\/span><\/h3>\n
Length of lis is 5<\/pre>\n
Note that the time complexity of the above Dynamic Programming (DP) solution is O(n^2)<\/strong> and there is a O(nLogn)<\/strong> solution for the LIS problem.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Python Programming – Longest Increasing Subsequence – Dynamic Programming – LIS problem is to find the length of the longest subsequence of a given sequence<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,70145,83517],"tags":[72847,72842,72993,70483,72848,72840,72846,72994,72843,72992,72854,72844,72850,72839,72977,72979,72995,72978,72975,72981,72980,72976,72852,72855,72853,72851],"class_list":["post-25350","post","type-post","status-publish","format-standard","hentry","category-coding","category-dynamic-programming","category-python-programming","tag-concept-of-dynamic-programming","tag-define-dynamic-programming","tag-definition-of-dynamic-programming-in-python","tag-dynamic-programming","tag-dynamic-programming-code-generation-algorithm","tag-dynamic-programming-definition","tag-dynamic-programming-in-data-structure","tag-dynamic-programming-in-python","tag-dynamic-programming-problems","tag-dynamic-programming-python","tag-dynamic-programming-set-1","tag-dynamic-programming-software","tag-explain-dynamic-programming","tag-how-to-solve-dynamic-programming-problems","tag-longest-increasing-subsequence-c","tag-longest-increasing-subsequence-code","tag-longest-increasing-subsequence-in-python","tag-longest-increasing-subsequence-java","tag-longest-increasing-subsequence-nlogn","tag-longest-increasing-subsequence-recursive","tag-longest-increasing-subsequence-youtube","tag-longest-increasing-subsequences","tag-problems-on-dynamic-programming","tag-simple-dynamic-programming-example","tag-types-of-dynamic-programming","tag-youtube-dynamic-programming"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25350","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25350"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25350\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25350"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25350"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25350"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}