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
| 2 | The Art of Programming Sorting and Searching – D E Knuth - 1998 |
| 1 | Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware 1 – Vandana Sharma, Satwinder Singh, K. S. Kahlon |
| 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 |
| 22 | bottom-up-heapsort, a new variant of heapsort beating, on an average, quicksort (if n is not very small – I Wegener - 1993 |
| 40 | Quicksort – C A R Hoare - 1962 |
| 4 | The Ultimate Heapsort – Jyrki Katajainen - 1998 |
| 7324 | Cache-oblivious algorithms – M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN - 1999 |
