Longest Increasing Subsequence

A program to determine the length of a longest Increasing Subsequence given an integer sequence. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. Given an integer sequence X_0, X_1,...,X_n-1, an increasing subsequence corresponds to an increasing sequence of indices i_0, i_1,...,i_m-1 such that 0<= i_0,i_m-1 < n,i_k < i_k+1 for 0 <= k <= m-1ans X_i_k <= A_i_k+1 for 0 <= k ## Platform The program will be ran on a digital unix platform in c++.