In-depth engineering guides and resources.
Master Bubble Sort: adjacent element comparisons, swap optimizations, early termination flags, and stability analysis.
Master Bucket Sort: distribution sorting, uniform data partitioning, bucket insertion sort, and linear average-time complexity O(N+K).
Master Counting Sort: non-comparison integer sorting, frequency arrays, cumulative sums, and linear O(N+K) time guarantees.
Master Heap Sort: in-place comparison sorting using max-heaps, heapify operations, and guaranteed O(N log N) worst-case performance.
Master Insertion Sort: in-place shifting invariants, O(N) adaptive runtime on nearly-sorted data, inversion math, and hybrid quicksort cutoffs.
Master Merge Sort: divide-and-conquer recursive partitioning, stable two-way merging, and guaranteed O(N log N) runtime.
Master Quick Sort: Lomuto vs Hoare partitioning schemes, pivot selection strategies, recursion depth limits, and average O(N log N) speed.
Master Radix Sort: non-comparison digit-by-digit sorting using counting sort subroutines for integers and fixed-length strings.
Master Selection Sort: minimum element scanning, in-place index swapping, and comparison trade-offs against insertion sort.