How is it possible.If the range is 1 to N then we could use counting sort.But how can we do it in linear time .Any kind of sorting algorithm exists for this case??
On 1 August 2011 21:03, payel saha <[email protected]> wrote: > > > You have an integer array of length N, containing values in the range > 1,2,3…N^2. Sort the array in O(N) time > > -- > 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.
