An in-place heapsort algorithm requiring n log n + n log* n −0.546871 n comparisons

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.88, Iss.16, 2011-11, pp. : 3350-3360

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

An (n log n) algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

Optimization, Vol. 64, Iss. 3, 2015-03 ,pp. : 595-602

Taylor & Francis Ltd

Access to resources Recommend Favorite

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

By Bhattacharya B.K. Kaller D.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 336-358

Academic Press

Access to resources Recommend Favorite

Bridging across the log(n) Space Frontier

By Geffert V.

Information and Computation, Vol. 142, Iss. 2, 1998-05 ,pp. : 127-158

Academic Press

Access to resources Recommend Favorite

Asymptotic expansion for log n! in terms of the reciprocal of a triangular number

By Nemes Gergő

Acta Mathematica Hungarica, Vol. 129, Iss. 3, 2010-11 ,pp. : 254-262

Springer Publishing Company

Access to resources Recommend Favorite

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

By Thorup M.

Journal of Algorithms, Vol. 42, Iss. 2, 2002-02 ,pp. : 205-230

Academic Press

Access to resources Recommend Favorite