<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/%E5%A0%86%E7%A9%8D%E6%8E%92%E5%BA%8F/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 18:31:12 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/%E5%A0%86%E7%A9%8D%E6%8E%92%E5%BA%8F/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>堆积排序(Heap Sort)算法，利用完全二元树来排序的算法</title><link>https://magiclen.org/cn/heap-sort/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/05/1463382782_icon_23_one_finger_double_tap-660x486.png 3x" alt>
堆积排序(Heap Sort)算法是利用完全二元树(Complete Binary Tree)，也就是堆积(Heap)结构来完成排序的算法。虽然说要用到堆积结构，看起来好像很复杂似的，但其实这个只要一般的数组结构（可以直接用要排序的数组来制作）就能实作出来，而且实作出来的速度保证不会太慢，再怎么差都会有 O(nlogn) 的时间复杂度。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>排序算法</category><category>Rust</category><category>堆积排序</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/heap-sort</guid><pubDate>Fri, 5 Apr 2019 20:00:45 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>