Stats
Implementations
Pigeonhole Sort is a non-comparison sorting algorithm suitable when the number of elements and the range of possible key values are approximately the same. It works by placing elements into 'holes' corresponding to their key values and then collecting them in order.
Paradigm
Distribution / Counting
Author
Unknown
Tier
CTime Complexity
Best
O(n + k)Avg
O(n + k)Worst
O(n + k)Space
O(k)Properties