The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
A. O(n)
B. O(n Ig n)
C. O(n2)
D. None of the above
Answer:B
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
A. O(n) B. O(n Ig n) C. O(n2) D. None of the above