<?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/merge-sort/feed</link><description>多元化原創文章，內容包羅萬象，有程式語言、網站應用、軟體介紹、硬體介紹、作業系統、旅行遊記、專題採訪、益智問題、文學創作，以及作者們的知識分享和作品分享。</description><language>zh-TW</language><lastBuildDate>Mon, 6 Apr 2026 10:15:31 +0000</lastBuildDate><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>合併排序(Merge Sort)演算法，穩定、快速的排序演算法</title><link>https://magiclen.org/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>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/merge-sort</guid><pubDate>Fri, 5 Apr 2019 18:00:28 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>MagicSort─支援非同步排序與計算排序進度的Java排序函式庫</title><link>https://magiclen.org/magicsort</link><description><![CDATA[    <img src="https://magiclen.org/wp-content/uploads/2016/02/java-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/02/java-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/02/java-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/02/java-660x486.png 3x" alt="">
Java內建的排序方法無法在非同步執行緒下進行工作，因為沒有Callback的機制，如果將排序工作丟給另外一個執行緒執行的話，會不知道排序程式究竟何時會跑完。寫程式的時候，有時必須排序龐大的資料，如果未將排序單獨丟給另一個執行緒的話，會造成程式停頓，又因Java內建的排序方法，會使用到遞迴，在資料量大的時候，會用到很多Stack(堆疊)空間，有可能會導致Stack Overflow。所以為了解決J...]]></description><category>Java</category><category>Java</category><category>MagicSort</category><category>交換排序</category><category>合併排序</category><category>字串排序</category><category>快速排序</category><category>插入排序</category><category>自然排序</category><category>選擇排序</category><category>路徑排序</category><guid>https://magiclen.org/magicsort</guid><pubDate>Sat, 5 Apr 2014 13:45:17 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>