Block Sort, also known as Block Merge Sort, is an in-place, stable sorting algorithm that divides the array into blocks and merges them efficiently using a combination of internal and external buffers.
Paradigm
Divide and Conquer / Block Merge
Author
Computer Scientists
Tier
Time Complexity
Best
Avg
Worst
Space
O(√n)
Properties