Premium
A stable quicksort
Author(s) -
Motzkin Dalia
Publication year - 1981
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380110604
Subject(s) - quicksort , computer science , hybrid algorithm (constraint satisfaction) , sorting , sorting algorithm , algorithm , parallel computing , artificial intelligence , constraint satisfaction , probabilistic logic , constraint logic programming
A sorting algorithm, called Stable Quicksort, is presented. the algorithm is comparable in speed with the Quicksort algorithm, but is stable. The experimental evidence presented support the theoretical evaluation of the performance of Stable Quicksort.