<?xml version="1.0" encoding="utf-8"?><rss version="2.0" 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/tag/bubble-sort/feed</link><description>多元化原創文章，內容包羅萬象，有程式語言、網站應用、軟體介紹、硬體介紹、作業系統、旅行遊記、專題採訪、益智問題、文學創作，以及作者們的知識分享和作品分享。</description><language>zh-TW</language><lastBuildDate>Wed, 8 Apr 2026 17:15:36 +0000</lastBuildDate><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>雞尾酒排序(Cocktail Sort)演算法，雙向的氣泡排序法</title><link>https://magiclen.org/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>Java</category><category>Rust</category><category>演算法</category><category>Go</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/cocktail-sort</guid><pubDate>Fri, 5 Apr 2019 14:00:24 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>氣泡排序法(Bubble Sort)演算法，容易實作的穩定排序演算法</title><link>https://magiclen.org/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="">
氣泡排序(Selection Sort)演算法又稱為泡沫排序演算法，是基本的排序演算法，是學習程式語言最先需要學會的排序演算法之一。顧名思義，就是它的排序方式如同氣泡一般，不斷將最大的元素擠出(移動)到序列最尾端，當所有元素都被被擠出後，排序就完成了！而且排序結果是穩定的。]]></description><category>研究分享</category><category>Java</category><category>Rust</category><category>演算法</category><category>Go</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/bubble-sort</guid><pubDate>Fri, 5 Apr 2019 10:00:26 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>