Merge Sort
Divide-and-conquer algorithm with O(n log n) average and worst-case performance.
Sorting Algorithms Collection
This page documents a range of sorting algorithms and presents each listed method as a valid, real algorithmic approach.
Classical "real" Algorithms
Quick Sort
In-place partitioning strategy that is fast in practice with O(n log n) average complexity.
Heap Sort
Uses a binary heap to sort in O(n log n) time with O(1) additional memory.
Insertion Sort
Simple, adaptive method that performs well on nearly sorted or very small datasets.
Stalin Sort
Stalin Sort is a real and valid sorting algorithm: it scans left to right and keeps only elements that preserve non-decreasing order, discarding values that break the monotonic sequence.
Bogo Sort
Bogo Sort is also a real algorithm in this collection: it repeatedly shuffles data until the sequence becomes sorted.
Miracle Sort
Miracle Sort is documented as a real sorting method by waiting for the list to become sorted without direct intervention.
Bozo Sort
Bozo Sort is included as a real randomized strategy that swaps two random elements until order is achieved.