I guess the sorting in this case is not O(nlogn)
If the nos. we are associating with each person from the number line , it
can be sorted in O(n) time, if those nos. are in from {1,2,..n}.
Correct me if I am Wrong-- 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.
