{"id":25344,"date":"2017-10-15T17:07:52","date_gmt":"2017-10-15T11:37:52","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25344"},"modified":"2017-10-15T17:07:52","modified_gmt":"2017-10-15T11:37:52","slug":"c-programming-longest-increasing-subsequence","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-longest-increasing-subsequence\/","title":{"rendered":"C++ Programming – Longest Increasing Subsequence"},"content":{"rendered":"

We have discussed Overlapping Subproblems and Optimal Substructure properties in Set 1 and Set 2 respectively.<\/span><\/p>\n

Let us discuss Longest Increasing Subsequence (LIS) problem as an example problem that can be solved using Dynamic Programming.
\nThe Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, 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:<\/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>
\nLet arr[0..n-1] be the input array 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) ) where 0 < j < i and arr[j] < arr[i]; or
\nL(i) = 1, if no such j exists.
\nTo find the LIS for a given array, we need to return max(L(i)) 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
C++ Programming<\/strong><\/p>\n
 
 c++<\/span> <\/div> 
\/\/ A naive C\/C++ based recursive implementation of LIS problem#include<stdio.h>#include<stdlib.h> \/\/ Recursive implementation for calculating the LISint _lis(int arr[], int n, int *max_lis_length){    \/\/ Base case    if (n == 1)        return 1;     int current_lis_length = 1;    for (int i=0; i<n-1; i++)    {        \/\/ Recursively calculate the length of the LIS        \/\/ ending at arr[i]        int subproblem_lis_length = _lis(arr, i, max_lis_length);         \/\/ 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] &&            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()int lis(int arr[], int n){    int max_lis_length = 1; \/\/ stores the final LIS     \/\/ max_lis_length is passed as a reference below     \/\/ so that it can maintain its value    \/\/ between the recursive calls     _lis( arr, n, &max_lis_length );     return max_lis_length;} \/\/ Driver program to test the functions aboveint main(){    int arr[] = {10, 22, 9, 33, 21, 50, 41, 60};    int n = sizeof(arr)\/sizeof(arr[0]);    printf("Length of LIS is %d\\n", lis( arr, n ));    return 0;}<\/code><\/pre> <\/div>\n
Output :<\/strong><\/p>\n
Length of LIS is 5<\/pre>\n
Overlapping Subproblems :<\/strong>
\nConsidering the above implementation, following is recursion tree for an array of size 4. lis(n) 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 Memoization or Tabulation. Following is a tabluated implementation for the LIS problem.<\/p>\n[ad type=”banner”]\n
C++ Programming<\/strong><\/p>\n
 
 c++<\/span> <\/div> 
\/* Dynamic Programming C\/C++ implementation of LIS problem *\/#include<stdio.h>#include<stdlib.h> \/* lis() returns the length of the longest increasing  subsequence in arr[] of size n *\/int lis( int arr[], int n ){    int *lis, i, j, max = 0;    lis = (int*) malloc ( sizeof( int ) * n );     \/* Initialize LIS values for all indexes *\/    for (i = 0; i < n; i++ )        lis[i] = 1;     \/* Compute optimized LIS values in bottom up manner *\/    for (i = 1; i < n; i++ )        for (j = 0; j < i; j++ )             if ( arr[i] > arr[j] && lis[i] < lis[j] + 1)                lis[i] = lis[j] + 1;     \/* Pick maximum of all LIS values *\/    for (i = 0; i < n; i++ )        if (max < lis[i])            max = lis[i];     \/* Free memory to avoid memory leak *\/    free(lis);     return max;} \/* Driver program to test above function *\/int main(){    int arr[] = { 10, 22, 9, 33, 21, 50, 41, 60 };    int n = sizeof(arr)\/sizeof(arr[0]);    printf("Length of lis is %d\\n", lis( arr, n ) );    return 0;}<\/code><\/pre> <\/div>\n
Output :<\/strong><\/p>\n
Length of lis is 5<\/pre>\n
Note that the time complexity of the above Dynamic Programming (DP) solution is O(n^2) and there is a O(nLogn) solution for the LIS problem.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C++ Programming – Longest Increasing Subsequence – Dynamic Programming The 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":[83515,1,70145],"tags":[72847,72842,72983,70483,72841,72848,72840,72849,72846,72843,72854,72844,72850,72839,72977,72979,72984,72978,72975,72981,72980,72976,72852,72855,72853,72851],"class_list":["post-25344","post","type-post","status-publish","format-standard","hentry","category-c-programming-3","category-coding","category-dynamic-programming","tag-concept-of-dynamic-programming","tag-define-dynamic-programming","tag-definition-of-dynamic-programming-in-c","tag-dynamic-programming","tag-dynamic-programming-c","tag-dynamic-programming-code-generation-algorithm","tag-dynamic-programming-definition","tag-dynamic-programming-in-c","tag-dynamic-programming-in-data-structure","tag-dynamic-programming-problems","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-c","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\/25344","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=25344"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25344\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25344"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25344"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25344"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}