Articles, deep dives, and notes from the engineering community.
A unique concurrency-based sorting algorithm: spawns a separate thread for each element, sleeping for a duration proportional to the element value before writing it to the output.
By Md. Harun-Or-Roshid
A parallel dimension sorting algorithm: organizes elements in a 3D coordinate cube and sorts vectors along the height, width, and depth axes sequentially to achieve sorted order.
A card-game inspired sorting algorithm: distributes elements onto a series of piles such that each pile's top is \(\ge\) the incoming value, then performs a multi-way merge across pile tops.
A gapped variation of Insertion Sort: leaves empty slots (gaps) in the array, allowing elements to be inserted in \(O(1)\) shift time on average by avoiding massive shifts.
An educational predecessor of Heapsort: finds the minimum element of the remaining unsorted range using a binary tournament tree of comparisons, swapping the champion to the sorted list.
A unique list-extraction sorting algorithm: repeatedly pulls out sorted ascending chains (strands) from the unsorted data, merging them step-by-step into a growing sorted list.
A randomized educational sorting algorithm: checks if the array is sorted, and if not, swaps a single random pair of elements and repeats.
The ultimate joke sorting algorithm: shuffles elements randomly and checks if they are sorted, repeating until luck prevails.
A humorous sorting algorithm based on the "multiply and surrender" paradigm: recursively sorts halves, swaps the mid and end values to find the local max, and recurse again on the remaining prefix.
An educational recursive sorting algorithm: achieves correct sorting by recursively sorting the first two-thirds, last two-thirds, and first two-thirds of the list again.
An optimized run generation algorithm: uses a Min-Heap buffer to stream sorted runs to disk, producing runs that are on average twice the size of available system RAM.
A highly sophisticated asymmetric external sort: dynamically decreases the merge fan-in order step-by-step from \(T-1\) down to 2, optimizing tape operations without requiring rewinds.