[algogeeks] Find all longest increasing subsequence of length k

[atul anand]

Hi,

suggest an algo which will find all longest increasing sub
sequence of length K.

for eg:-
input : 7 8 9 4 10 11
K=3

output :
7 8 9
7 9 10
7 10 11
8 9 10
8 10 11

desired complexity : O(k*n*logn)

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Find all longest increasing subsequence of length k

[atul anand]

Hi,

suggest an algo which will find all longest increasing sub
sequence of length K.

for eg:-
input : 7 8 9 4 10 11
K=3

output :
7 8 9
7 9 10
7 10 11
8 9 10
8 10 11

desired complexity : O(k*n*logn)

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.