Pigeonhole Sort
Pigeonhole Sort Pigeonhole sort is a direct address sorting algorithm for integers in a small contiguous range. It creates one slot, or pigeonhole, for each possible key value, places elements into their matching slot, then scans the slots in order to rebuild the sorted array. It is close to counting sort, but the usual presentation stores the actual elements in holes rather than only their counts. Problem Given an array...