I agree with you completely but for the problem that I posted it is enough that we have O(n) in accessing the elements in order. Your solution does better by calculating every element in O(1) time. The key now is to do the actual sorting with this method
--~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
