0 votes 0 votes The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is $\text{O(n)}$ $\text{O(n Ig n)}$ $\text{O(n$^2$)}$ None of the above Algorithms algorithms time-complexity ugcnetcse-sep2013-paper3 + – im.raj asked Jun 16, 2016 • edited Jan 5 by makhdoom ghaya im.raj 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes The correct answer would be B) $O(n Log n)$ Here is the details if you are interested. Thanks. rude answered Jun 16, 2016 • selected Jun 16, 2016 by im.raj rude comment Share Follow See all 0 reply Please log in or register to add a comment.