@Mannu. You said that the complexity of the counting sort is O(n). Doesn't the complexity depends on the data? In particular, I'm asking you to explain more completely how you obtain O(n) complexity with the counting sort on a particular data set where the range of the data depends on n. Can you do it? Or were you too cavalier in throwing out the counting sort and O(n)?
Dave On Mar 1, 10:20 am, MANNU <manishkr2...@gmail.com> wrote: > @Dave: Can you please explain it? I am not getting you. -- 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.
