Comparison Sort Algorithms cannot sort in linear time( http://www.rawkam.com/?p=886) so we have to use some non-comparison sorting algorithm like Counting Sort,Bucket Sort, Radix Sort etc.
But all the non-comparison sort algorithms requires the input to be in a particular order. (For example: Counting Sort will not be a good option if range of numbers is high. On Mon, Aug 23, 2010 at 4:20 PM, Tanveer Asif <[email protected]>wrote: > Count sort.. > > > ------------------------------ > *From:* Subhranil Banerjee <[email protected]> > *To:* [email protected] > *Sent:* Mon, August 23, 2010 3:36:12 AM > *Subject:* [algogeeks] Sorting algorithm > > Can anyone suggest a sorting algorithm that sorts in linear time without > using extra space. > > -- > 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]<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.
