The time complexity of an efficient algorithm to find the longest…
UGC NET 2013
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
Attempted by 7 students.
Sign up free to check your answer
Sign up freeLoading lesson…

