Question: Show that a sequence of n distinct numbers contains a decreasing or increasing subsequence of size at least [n].
Show that a sequence of n distinct numbers contains a decreasing or increasing subsequence of size at least [√n].
Step by Step Solution
3.42 Rating (174 Votes )
There are 3 Steps involved in it
Given a array of N integer we need to find the long sub sequence in d... View full answer
Get step-by-step solutions from verified subject matter experts
