<?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/sorting-algorithm/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 19:05:21 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/sorting-algorithm/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>基数排序(Radix Sort)算法，可以依据多个键值来排序的算法</title><link>https://magiclen.org/cn/radix-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>
基数排序(Radix Sort)算法是可以利用多个键值来排序数据的算法。排序还需要多个键值？有时候当然会需要啦！像是要排序文件时，可以先依照文件名称排序后，再依照文件大小来排，如此一来，整体上来看这些文件，会是以文件大小来排序，而相同文件大小的文件则是会依照文件名称来排序。基数排序法可以将整数的各个位数当作是键值，来进行线性时间的排序，比起会依照 k（要排序的数据可能的值的数量）愈大而愈吃空间的计...]]></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/radix-sort</guid><pubDate>Thu, 30 May 2019 20:00:25 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>桶排序(Bucket Sort)算法，利用表达式将数据分类、排序后，再合并起来的排序算法</title><link>https://magiclen.org/cn/bucket-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>
桶排序(Bucket Sort)算法是先将大量数据分类成少量数据后，再进行排序的算法。可以透过简单的表达式来完成数据的分类，在最好的情况之下，数据可以被完全打散，此时的时间复杂度就会是一个线性时间。]]></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/bucket-sort</guid><pubDate>Sun, 26 May 2019 12:00:30 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><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><item><title>合并排序(Merge Sort)算法，稳定、快速的排序算法</title><link>https://magiclen.org/cn/merge-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>
合并排序(Merge 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/merge-sort</guid><pubDate>Fri, 5 Apr 2019 18:00:28 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>希尔排序(Shell Sort)算法，改良的插入排序法</title><link>https://magiclen.org/cn/shell-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>
希尔排序(Shell Sort)算法是插入排序(Insertion Sort)算法的改良版。它解决了插入排序法一次只能把元素移动一个索引距离的问题，加入间距(gap)的概念来分批并分组完成插入排序法，有效提升原本插入排序法的速度。]]></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>希尔排序</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/shell-sort</guid><pubDate>Fri, 5 Apr 2019 16:00:52 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>鸡尾酒排序(Cocktail Sort)算法，双向的冒泡排序法</title><link>https://magiclen.org/cn/cocktail-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>
鸡尾酒排序(Cocktail Sort)算法又称为摇晃排序(Shaker Sort)算法、双向冒泡排序(Bidirectional Bubble Sort)算法，顾名思义，它是冒泡排序(Bubble Sort)算法的变体，将原本单向走访的冒泡排序改为双向，用以解决使用冒泡排序法时，串行中未排序的一端其实已经大致排序好，却又不能尽快把它完成的情形。]]></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>鸡尾酒排序</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/cocktail-sort</guid><pubDate>Fri, 5 Apr 2019 14:00:24 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>插入排序(Insertion Sort)算法，一边将元素加进串行、一边进行排序的算法</title><link>https://magiclen.org/cn/insertion-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>
插入排序(Insertion Sort)算法，是基本的排序算法，是学习编程语言最先需要学会的排序算法之一。插入排序法的用途广泛，除了可以用来将新元素添加到已存在且已排序好的串行并维持其排序外，还可以用来排序尚未排序的串行。而且其排序结果是稳定的。]]></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/insertion-sort</guid><pubDate>Fri, 5 Apr 2019 12:00:06 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>冒泡排序法(Bubble Sort)算法，容易实作的稳定排序算法</title><link>https://magiclen.org/cn/bubble-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>
冒泡排序(Bubble Sort)算法又称为泡沫排序算法，是基本的排序算法，是学习编程语言最先需要学会的排序算法之一。顾名思义，就是它的排序方式如同气泡一般，不断将最大的元素挤出（移动）到串行最尾端，当所有元素都被挤出后，排序就完成了！而且排序结果是稳定的。]]></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/bubble-sort</guid><pubDate>Fri, 5 Apr 2019 10:00:26 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>选择排序(Selection Sort)算法，最简单的排序算法</title><link>https://magiclen.org/cn/selection-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>
选择排序(Selection Sort)算法是最基本的排序算法，是学习编程语言最先需要学会的排序算法之一。它可以按照元素值的大小序次，一一将最小值、第二小值等等的元素排入串行中的正确索引位置内。]]></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>选择排序</category><category>Rust</category><category>TypeScript</category><category>Go</category><guid>https://magiclen.org/cn/selection-sort</guid><pubDate>Fri, 5 Apr 2019 08:00:02 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>快速排序(Quick Sort)算法，瞬间就可以排好超大串行！</title><link>https://magiclen.org/cn/quick-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>
快速排序(Quick Sort)算法又称为划分交换排序(Partition-Exchange 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/quick-sort</guid><pubDate>Thu, 4 Apr 2019 18:50:22 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>