external merge sort is a merge sort that is used when size of the list you want to sort is too huge for your fast memory to store. The algorithm divides a list into multiple chunks that fit your fast memory and runs merge sort to each.

kenzan8000 のブックマーク 2020/06/30 14:46

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/4687862407450518018/comment/kenzan8000" data-user-id="kenzan8000" data-entry-url="https://b.hatena.ne.jp/entry/s/www.youtube.com/watch?v=5mKtLu60pdw" data-original-href="https://www.youtube.com/watch?v=5mKtLu60pdw" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D5mKtLu60pdw" data-user-icon="/users/kenzan8000/profile.png">External Memory Mergesort</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/sort">sort</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22external%20merge%20sort%22">external merge sort</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22data%20structure%22">data structure</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/algorithm">algorithm</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22computer%20science%22">computer science</a>]</li></ul><br><p style="clear: left"> external merge sort is a merge sort that is used when size of the list you want to sort is too huge for your fast memory to store. The algorithm divides a list into multiple chunks that fit your fast memory and runs merge sort to each.</p><a class="datetime" href="https://b.hatena.ne.jp/kenzan8000/20200630#bookmark-4687862407450518018"><span class="datetime-body">2020/06/30 14:46</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！