Hi,
I wanted to partition the given set(S) into k-subsets,
such that every element of subset(i-1) is lesser than every element of
subset(i), where i belongs to {1,2,....k}.
Since those subsets may not be sorted, So Is it possible to do this in
O(nlogn)?
Thanks & Regards,
B Anil Kumar.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
