Pigeonhole Sort Algorithm

Pigeonhole sort is a sorting algorithm suited to lists whose number of elements and whose range of possible key values are of roughly the same size, giving it a running time linear in the combined size of the input and the key range. It is similar to counting sort but moves each item directly into a pigeonhole bucket that matches its key rather than first building a separate count array and computing final positions from it.