<?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>Priority-Queue on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/priority-queue/</link><description>Recent content in Priority-Queue on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Sat, 06 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/priority-queue/index.xml" rel="self" type="application/rss+xml"/><item><title>排序专题（六）：堆排序——原地 O(n log n) 的稳健方案</title><link>https://shio-chan-dev.github.io/jeanblog/zh/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/zh/alg/sorting/6.sorting-series-heap-sort/</guid><description>讲解堆排序的原理、复杂度与工程场景，对比快排/归并的取舍，附多语言实现和 top-k 应用示例。</description></item></channel></rss>