- You are given a number n, representing the number of elements.
- You are given n numbers, representing the contents of an array of length n.
- You are required to print the length of the Longest Increasing Subsequence of the array.
Reader, the subsequences of a string "abc" are listed in figure
Hence, out of all the subsequences we have to find that subsequence which has the longest length and is in increasing order.
We discuss this problem for the input array [10, 22, 9, 33, 21, 50, 41, 60, 80, 1].