Lesson plan
Block sort
Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at (see Big O notation) in-place stable sorting time. It gets its name from the observation that merging two sorted lists, and , is equivalent to breaking into evenly sized blocks, inserting each block into under special rules, and merging pairs. One practical algorithm for in-place merging was proposed by Pok-Son Kim and Arne Kutzner in 2008.
Article summary
Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at (see Big O notation) in-place stable sorting time. It gets its name from the observation that merging two sorted lists, and , is equivalent to breaking into evenly sized blocks, inserting each block into under special rules, and merging pairs. One practical algorithm for in-place merging was proposed by Pok-Son Kim and Arne Kutzner in 2008.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.