Divide and Conquer on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/divide-and-conquer/Recent content in Divide and Conquer on Jeanphilo BlogHugo -- 0.159.2en-usTue, 10 Feb 2026 17:07:38 +0800Hot100: Sort List Linked-List Merge Sort ACERS Guidehttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Tue, 10 Feb 2026 17:07:38 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Sort a singly linked list in O(n log n) time using split + recursive merge sort. This guide explains derivation, invariants, engineering mappings, and runnable multi-language implementations.Hot100: Merge K Sorted Lists Divide-and-Conquer O(N log k) ACERS Guidehttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/23-merge-k-sorted-lists/Tue, 10 Feb 2026 17:05:53 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/23-merge-k-sorted-lists/Upgrade from LeetCode 21 to k-way merge: derive why sequential merge degrades, then use divide-and-conquer to reach O(N log k), with heap comparison and runnable multi-language implementations.Sorting Series (5): Quick Sort - Pivot Strategy, Tail Recursion, Engineering Practicehttps://shio-chan-dev.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/Fri, 05 Dec 2025 00:00:00 +0000https://shio-chan-dev.github.io/jeanblog/alg/sorting/5.sorting-series-quick-sort/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 Sortinghttps://shio-chan-dev.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/Thu, 04 Dec 2025 00:00:00 +0000https://shio-chan-dev.github.io/jeanblog/alg/sorting/4.sorting-series-merge-sort/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.