girsh and kamlesh: that may work if the (n-1) numbers are integers 1 to n. What if they can be anything. (from your S(n) = n*(n+1) / 2 ) ) adak : distribution sort - this is effectively the same as the bitmap thing which Lego Haryanto mentioned in the beginning. (we're only using a byte or something like that instead of a bit)
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
