Implementing HEAPSORT with n log n - 0.9n and QUICKSORT with n log n + 0.2n Comparisons (2002)
by
Stefan Edelkamp
,
Patrick Stiegeler
| Venue: | ACM Journal of Experimental Algorithms |
| Citations: | 1 - 1 self |
BibTeX
@ARTICLE{Edelkamp02implementingheapsort,
author = {Stefan Edelkamp and Patrick Stiegeler},
title = {Implementing HEAPSORT with n log n - 0.9n and QUICKSORT with n log n + 0.2n Comparisons},
journal = {ACM Journal of Experimental Algorithms},
year = {2002},
volume = {7}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
With refinements to the WEAK-HEAPSORT...
