Live briefing
Everything about Block sort
Efficient sorting algorithm that combines insert and merge operations
Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big O notation) in-place stable sorting time. It gets its name from the observation that merging two sorted lists, A and B, is equivalent to breaking A into evenly sized blocks, inserting each A block into B under special rules, and merging AB pairs. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Block sortA 5-minute orientation
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: The new block pixel sort algorithm for TVC-encrypted medical imageCited 40 times
- Go sideways: Heap's algorithmA closely related topic
- Go sideways: SamplesortA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
Overcoming Anxiety for DummiesCharles H. Elliott, Ph.D., Laura L. Smith Ph.D. · 2002
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
Apache CookbookKen Coar, Rich Bowen · 2003
Word 2010 for DummiesDan Gookin, Judith Muhr · 2010
Automate the Boring Stuff with PythonAl Sweigart · 2015
Linux System ProgrammingRobert Love · 2007
Algorithms in a nutshellGeorge T. Heineman · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Heap's algorithm Heap's algorithm generates all possible permutations of n objects. It was first proposed by B. R. Heap in 1963. The algorithm minimizes movement: it generates…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Proxmap sort ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets…
- Bucket sort Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted…
- Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…
- Counting sort In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it…