Indexed by：
Abstract：
This paper presents a new variant of in place sort algorithm, n improved Heapsort algorithm. In the worst case, the improved algorithm requires nlogn+nlog*n+O(n) comparisons and nlogn+O(n) moves. © 2011 Published by Elsevier Ltd.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
ISSN： 1877-7058
Year： 2012
Volume： 29
Page： 2274-2278
Language： English
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count： 4
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
