QuickHeapsort, an efficient mix of classical sorting algorithms

Author： Cantone D.   Cincotti G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.285, Iss.1, 2002-08, pp. : 25-42

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Communication-Efficient Sorting Algorithms on Reconfigurable Array of Processors With Slotted Optical Buses

By Hamdi M.   Qiao C.   Pan Y.   Tong J.  

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 166-187

Academic Press

Access to resources Recommend Favorite

Algorithms for Marketing-Mix Optimization

By Gudmundsson Joachim   Morin Pat   Smid Michiel  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 1004-1016

Springer Publishing Company

Access to resources Recommend Favorite

Sorting algorithms for broadcast communications: mathematical analysis

By Grabner P.J.   Prodinger H.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 51-67

Elsevier

Access to resources Recommend Favorite

Heaps and heapsort on secondary storage

By Fadel R.   Jakobsen K.V.   Katajainen J.   Teuhola J.  

Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. : 345-362

Elsevier

Access to resources Recommend Favorite

Optimal heapsort algorithm

By Xunrang G.   Yuzhang Z.  

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 239-243

Elsevier

Access to resources Recommend Favorite