@Rujin Cao: Yea, your formulation of the problem is correct.. my bad,. missed that there are N numbers. can u elaborate more on the discretization procedure and how ll u do counting sort (which might warrant traversing of N^2 elements)
On Jun 26, 5:45 pm, Rujin Cao <drizzle...@gmail.com> wrote: > @ross: > I guess the orignal problem is that there are N numbers which are all in the > range [1, N * N], can you do the sorting in O(N) time complexity? > > If this is true, we can firstly do the discretization and then do the > counting sort. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
