Skip to search formSkip to main contentSkip to account menu

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 O(n log n) in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
64-bit computingAdaptive sortArray data structureBinary search algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2004
Review
2004
In-Place Merging Algorithms
In this report we consider the problem of merging two sorted lists of m and n keys each in-place. We survey known techniques for… 
2000
2000
새로운 정렬 알고리즘 : 정보 블록 정렬 알고리즘
본 논문에서는 정보블록알고리즘(IBPA; Information Block Preprocessing Algorithm)을 이용한 정보블록 정렬알고리즘(IBSA; Information Block Sort Algorithm… 
1995
1995
Experiments with a Block Sorting Text Compression Algorithm
This report presents some preliminary work on a recently described “Block Sorting” lossless or text compression algorithm. While… 
1982
1982
Block Sorting of a Large File in External Storage by a 2-Component Key
This paper introduces a sorting method (a block sort embedded with another sorting algorithm) to sort a large volume of records… 
1968
1968
A generalized partial pass block sort
The design of a partial pass block sort with arbitrary range of key and number of work files is described. The design is a… 
1956
1956
Sorting on a multiple magnetic tape unit
Various techniques have been devised for sorting on general purpose computers. Most of these utilize magnetic tape units since… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)