Sorting Series (8): TimSort and Introsort - Engineering Patterns Behind Built-in Sorts
Explain Python/Java TimSort and C++ std::sort Introsort: triggers, stability, complexity, trade-offs, with skeletons and selection guidance.
Algorithms
Sorting Series (6): Heap Sort - In-place O(n log n) with Worst-Case Guarantees
Explain heap sort principles, complexity, and engineering scenarios; compare with quick/merge; include multilingual implementations and top-k examples.
Sorting Series (5): Quick Sort - Pivot Strategy, Tail Recursion, Engineering Practice
Comprehensive quicksort guide: pivot selection, three-way partitioning, tail recursion optimization, hybrid sorting practices, with multilingual implementations and engineering guidance.
Sorting Series (4): Merge Sort - Stable Divide and Conquer and External Sorting
Systematic explanation of merge sort principles, stability, space trade-offs, and engineering scenarios with Python/C/C++/Go/Rust/JS implementations and external sorting guidance.
Sorting Series (3): Shell Sort - From Insertion to Gap-Based Efficiency
Explain Shell sort principles, gap strategies, and engineering usage with scenarios and Python/C/C++/Go/Rust/JS implementations.
Sorting Series (2): Bubble, Selection, Insertion - Three O(n^2) Baselines
Systematic ACERS explanation of bubble/selection/insertion sorts: principles, stability, scenarios, and multilingual implementations with selection guidance.
Sorting Series (1): How to Choose an Algorithm - Time, Space, Stability, Scenarios
Use the ACERS template to map common sorting algorithms by scenario, complexity, stability, and engineering usage, with runnable examples and a selection checklist.