A class of sorting algorithms based on Quicksort
- 1 April 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (4) , 396-402
- https://doi.org/10.1145/3341.3348
Abstract
Bsort, a variation of Quicksort, combines the interchange technique used in Bubble sort with the Quicksort algorithm to improve the average behavior of Quicksort and eliminate the worst case situation of O(n 2 ) comparisons for sorted or nearly sorted lists. Bsort works best for nearly sorted lists or nearly sorted in reverse.Keywords
This publication has 8 references indexed in Scilit:
- A stable quicksortSoftware: Practice and Experience, 1981
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- Survey on Algorithms 347, 426, and QuicksortACM Transactions on Mathematical Software, 1976
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- Algorithms 402: Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Algorithm 271: quickersortCommunications of the ACM, 1965
- Algorithm 64: QuicksortCommunications of the ACM, 1961