<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Sorting on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/</link><description>Recent content in Sorting on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Tue, 09 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/alg/sorting/index.xml" rel="self" type="application/rss+xml"/><item><title>Sorting Series (Final): Practical Selection - Choose by Scale, Stability, Memory, Distribution</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/9.sorting-series-selection-guide/</link><pubDate>Tue, 09 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/9.sorting-series-selection-guide/</guid><description>Practical selection guide: decision tables by scale/distribution/stability/memory, engineering scenarios, test checklist, and common pitfalls to apply the series.</description></item><item><title>Sorting Series (8): TimSort and Introsort - Engineering Patterns Behind Built-in Sorts</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/8.sorting-series-timsort-introsort/</link><pubDate>Mon, 08 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/8.sorting-series-timsort-introsort/</guid><description>Explain Python/Java TimSort and C++ std::sort Introsort: triggers, stability, complexity, trade-offs, with skeletons and selection guidance.</description></item><item><title>Sorting Series (7): Non-Comparison Sorting - Counting, Bucket, Radix and the Range/Digit Tradeoff</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/7.sorting-series-non-comparison/</link><pubDate>Sun, 07 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/7.sorting-series-non-comparison/</guid><description>Explain prerequisites, complexity, implementation details, and pitfalls of non-comparison sorts with multilingual examples for counting, bucket, and radix.</description></item><item><title>Sorting Series (6): Heap Sort - In-place O(n log n) with Worst-Case Guarantees</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/6.sorting-series-heap-sort/</link><pubDate>Sat, 06 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/6.sorting-series-heap-sort/</guid><description>Explain heap sort principles, complexity, and engineering scenarios; compare with quick/merge; include multilingual implementations and top-k examples.</description></item><item><title>Sorting Series (5): Quick Sort - Pivot Strategy, Tail Recursion, Engineering Practice</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/</link><pubDate>Fri, 05 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/</guid><description>Comprehensive quicksort guide: pivot selection, three-way partitioning, tail recursion optimization, hybrid sorting practices, with multilingual implementations and engineering guidance.</description></item><item><title>Sorting Series (4): Merge Sort - Stable Divide and Conquer and External Sorting</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/</link><pubDate>Thu, 04 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/</guid><description>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.</description></item><item><title>Sorting Series (3): Shell Sort - From Insertion to Gap-Based Efficiency</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/3.sorting-series-shell-sort/</link><pubDate>Wed, 03 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/3.sorting-series-shell-sort/</guid><description>Explain Shell sort principles, gap strategies, and engineering usage with scenarios and Python/C/C++/Go/Rust/JS implementations.</description></item><item><title>Sorting Series (2): Bubble, Selection, Insertion - Three O(n^2) Baselines</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/2.sorting-series-on2-baseline/</link><pubDate>Tue, 02 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/2.sorting-series-on2-baseline/</guid><description>Systematic ACERS explanation of bubble/selection/insertion sorts: principles, stability, scenarios, and multilingual implementations with selection guidance.</description></item><item><title>Sorting Series (1): How to Choose an Algorithm - Time, Space, Stability, Scenarios</title><link>https://shio-chan-dev.github.io/jeanblog/alg/sorting/1.sorting-series-preface/</link><pubDate>Mon, 01 Dec 2025 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/sorting/1.sorting-series-preface/</guid><description>Use the ACERS template to map common sorting algorithms by scenario, complexity, stability, and engineering usage, with runnable examples and a selection checklist.</description></item></channel></rss>