Back to Search
Start Over
A class of sorting algorithms based on Quicksort
- Source :
- Communications of the ACM. 28:396-402
- Publication Year :
- 1985
- Publisher :
- Association for Computing Machinery (ACM), 1985.
-
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.
Details
- ISSN :
- 15577317 and 00010782
- Volume :
- 28
- Database :
- OpenAIRE
- Journal :
- Communications of the ACM
- Accession number :
- edsair.doi...........c6c5b05b4d0f2aa02a14f499827d10dd