<?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>Heap on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/heap/</link><description>Recent content in Heap on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Sat, 06 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/heap/index.xml" rel="self" type="application/rss+xml"/><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></channel></rss>