Articles, deep dives, and notes from the engineering community.
A self-adjusting search tree sort: elements are inserted into a Splay Tree, splaying recently accessed nodes to the root, followed by an in-order retrieval.
By Md. Harun-Or-Roshid
An adaptive, heap-based algorithm: build a min-heap structured Cartesian tree in linear time, then sort by repeatedly pulling the minimum element into a priority queue.
An elegant tree-based algorithm: build a Binary Search Tree (BST) from the elements, then retrieve them in sorted order using an in-order traversal.
An efficient, in-place variant of MSD Radix Sort. It classifies elements into buckets and uses a permutation cycle to swap them into class boundaries in-place.
A brilliant, non-comparison sorting algorithm that achieves O(n) average-case speed in-place. It classifies elements into buckets, permutes them, and finishes with a fast Insertion Sort pass.
A simple, non-comparison sorting algorithm that is ideal when the range of values is approximately equal to the number of elements.
A distribution-based sorting algorithm that partitions elements into a finite number of buckets, sorts each bucket individually (using Insertion Sort), and then merges them.
A divide-and-conquer, digit-based sorting algorithm that processes digits from Most Significant (leftmost) to Least Significant, recursively sub-sorting buckets.
A clever sorting algorithm that processes digits from Least Significant (rightmost) to Most Significant (leftmost) using a stable sorting subroutine like Counting Sort.
An efficient, non-comparison-based sorting algorithm that runs in linear time. It works by counting the occurrences of each key within a specific range.
A brilliant, adaptive variation of Heapsort developed by Edsger Dijkstra in 1981. It achieves O(n) performance on sorted data while maintaining O(n log n) worst-case performance.
A clever sorting algorithm that relaxes the structure of binary heaps to minimize element comparisons, achieving performance extremely close to the information-theoretic lower bound.