Portal de Periódicos da CAPES

A class of sorting algorithms based on Quicksort

1985; Association for Computing Machinery; Volume: 28; Issue: 4 Linguagem: Inglês

10.1145/3341.3348

1557-7317

Roger L. Wainwright,

Data Management and Algorithms

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.