Length of longest increasing subs equence

Write a function to return an int indicating Longest Increasing subsequence in an array. This subsequence is not necessarily contiguous, or unique. For example in {10, 25, 9, 30, 21, 55, 40, 60, 75} the length of Longest Increasing Ssubsequence is 6 and the sequence could be [10,25,30,40,60,75] and [10,25,30,55,60,75] Input A set of integers separated by space Eg. 1 2 3 4 Output Longest incr