@ankit: Thats what i am saying as well .If The range is till N^2. how can we sort it in linear time?? If you know the answer please post it.
On 1 August 2011 21:47, ankit sambyal <[email protected]> wrote: > @raja : The range is 1-N^2 and not 1-N. Had it been 1-N , we could have > easily sorted the array in O(N) time using bit map. > > -- > 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. > -- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, [email protected] 7797137043. 09491690115. -- 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.
