A New Data Structure for Heapsort with Improved Number of Comparisons (Extended Abstract)

by Md. Shahjalal , M. Kaykobad
Citations:1 - 0 self

Documents Related by Co-Citation

8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
52 Quicksort – C A R Hoare
28 a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small – BOTTOM-UP-HEAPSORT - 1993
5 The Ultimate Heapsort – Jyrki Katajainen - 1998
2 Performance study of improved HeapSort algorithm and other sorting algorithms on different platforms – Ana Sharma, Satwinder Singh, Dr. K. S. Kahlon - 2008
2 The Art of Programming Sorting and Searching – D E Knuth - 1998
1 An empirical study of heap traversal and its applications – L J Mao, S D Lang - 2003
1 DualHeap sort algorithm: An inherently parallel generalization of heapsort. http://adsabs.harvard.edu/abs/2007arXiv0706.2893S – G Sepesi - 2007
1 The weak heapsort – R D Duton - 1993