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

  1. A.

    O(n)

  2. B.

    O(n Ig n)

  3. C.

    O(n2)

  4. D.

    None of the above

Attempted by 7 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…