Hi all, Quoted from Wikipedia: >Pigeonhole sorting, also known as count sort, is a sorting algorithm that >takes linear time (Θ(n)), which is the best possible performance for a sorting >algorithm since >one must inevitably look at each of the elements being sorted >at least once, regardless of the sorting algorithm. However, pigeonhole >sorting is only practical if the >objects you are sorting fall within (or can >be mapped into) a range of possible values that is small compared to the size >of the list to be sorted.
--~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
