Indexed by：
Abstract：
This paper presents a searching technique on a heap. By using the novel searching strategy, we propose a new variant of HeapSort algorithm. The new algorithm requires about nlogn+nlog*n+O(n) comparisons and nlogn+O(n) moves in the worst case. Copyright © 2011 Binary Information Press.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
Journal of Computational Information Systems
ISSN： 1553-9105
Year： 2011
Issue： 11
Volume： 7
Page： 3893-3898
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
