Data structures and sorting algorithms

Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets.
Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
It is a distribution sort, a generalization of pigeonhole sort that allows multiple keys per bucket, and is a cousin of radix sort in the most-to-least significant digit flavor.
Bucket sort can be implemented with comparisons and therefore can also be considered a comparison sort algorithm.
The computational complexity depends on the algorithm used to sort each bucket, the number of buckets to use, and whether the input is uniformly distributed.

Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of possible key values are approximately the same.
It requires O(n + N) time.
It is similar to counting sort, but differs in that it moves items twice: once to the bucket array and again to the final destination [whereas] counting sort builds an auxiliary array then uses the array to compute each item's final destination and move the item there.

Stooge sort is a recursive sorting algorithm.
It is notable for its exceptionally bad time complexity of mwe-math-element> = mwe-math-element>
The running time of the algorithm is thus slower compared to reasonable sorting algorithms, and is slower than bubble sort, a canonical example of a fairly inefficient sort.
It is however more efficient than Slowsort.
The name comes from The Three Stooges.