A class of sorting algorithms based on Quicksort

Authors:
Roger L. Wainwright
Affiliations:
The Univ. of Tulsa, Tulsa, OK
Venue:
Communications of the ACM - Lecture notes in computer science Vol. 174
Year:
1985

Citing 8
Cited 6

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Survey on Algorithms 347, 426, and Quicksort

ACM Transactions on Mathematical Software (TOMS)
Best sorting algorithm for nearly sorted lists

Communications of the ACM
Some performance tests of “quicksort” and descendants

Communications of the ACM
Algorithms 402: Increasing the efficiency of quicksort

Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Communications of the ACM
Algorithm 271: quickersort

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM

A survey of adaptive sorting algorithms

ACM Computing Surveys (CSUR)
Quicksort algorithms with an early exit for sorted subfiles

CSC '87 Proceedings of the 15th annual conference on Computer Science
An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms
Acceleration of sweep-line technique by employing smart quicksort

Information Sciences—Informatics and Computer Science: An International Journal
Inversion-sensitive sorting algorithms in practice
An empirical study for inversions-sensitive sorting algorithms

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

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(n2) comparisons for sorted or nearly sorted lists. Bsort works best for nearly sorted lists or nearly sorted in reverse.