abstract:Pigeonhole sorting, also known as count sort (not to be confused with counting sort), is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the number of possible key values (N) are approximately the same.NIST's Dictionary of Algorithms and Data Structures: pigeonhole sort It requires O(n + N) time.