What is Pigeonhole sort?

A polyphase merge sort is a variation of a bottom-up merge sort that sorts a list using an initial uneven distribution of sub-lists , primarily used for external sorting, and...

Tournament sort is a sorting algorithm. It improves upon the naive selection sort by using a priority queue to find the next element in the sort. In the naive selection...

Cocktail shaker sort, also known as bidirectional bubble sort, cocktail sort, shaker sort , ripple sort, shuffle sort, or shuttle sort, is an extension of bubble sort. The algorithm extends...

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...

A quantum sort is any sorting algorithm that runs on a quantum computer. Any comparison-based quantum sorting algorithm would take at least...

Cascade merge sort is similar to the polyphase merge sort but uses a simpler distribution. The merge is slower than a polyphase merge when there are fewer than six files,...

Oscillating merge sort or oscillating sort is a variation of merge sort used with tape drives that can read backwards. Instead of doing a complete distribution as is done in...

Kirkpatrick–Reisch sorting is a fast sorting algorithm for items with limited-size integer keys. It is notable for having an asymptotic time complexity that is better than radix sort.

Sort-en-Chalosse , literally Sort in Chalosse] is a commune in the Landes department in Nouvelle-Aquitaine in southwestern France.