I think the first 3 methods of the total 4 specified at http://www.rawkam.com/?p=168
will be applicable for sorting arrays with 0,1 &2 On Mon, Aug 23, 2010 at 11:07 AM, Jameel Mohamed <[email protected]>wrote: > Use counting sort. time complexity is O(n) > > On Aug 22, 1:11 pm, AlgoBoy <[email protected]> wrote: > > An algorithm to sort an array of 0's,1's,2's in a single pass... > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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.
