<?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/counting-sort/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 19:07:27 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/counting-sort/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>计数排序法(Counting Sort)，只需线性时间就能完成的超快排序法</title><link>https://magiclen.org/cn/counting-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>
计数排序(Counting Sort)算法是不需进行比较的排序算法，顾名思义，它会去数元素的数量来进行排序。这种排序法只需要线性时间和空间的复杂度就可以完成排序，比时间复杂度为 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>计数排序</category><category>Rust</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/counting-sort</guid><pubDate>Sat, 21 Oct 2017 06:03:39 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>