Searching on heaps - Details - 福州大学机构库

author：

Wu, Y. (Wu, Y..) ^[1] | Sun, Z. (Sun, Z..) ^[2] | Wang, X. (Wang, X..) ^[3]

Indexed by：

Scopus

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：

Algorithm; Complexity; Heap

Community：

[ 1 ] [Wu, Y.]School of Computer Science and Engineering, Southeast University, China
[ 2 ] [Wu, Y.]College of Mathematics and Computer Science, Fuzhou University, China
[ 3 ] [Sun, Z.]School of Computer Science and Engineering, Southeast University, China
[ 4 ] [Wang, X.]College of Mathematics and Computer Science, Fuzhou University, China
[ 5 ] [Wang, X.]College of Mathematics and Computer Science, Quanzhou Normal University, Quanzhou 362000, China

Reprint 's Address：

[Wang, X.]College of Mathematics and Computer Science, Fuzhou UniversityChina

Email：

yjwu@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Journal of Computational Information Systems

ISSN： 1553-9105

Year： 2011

Issue： 11

Volume： 7

Page： 3893-3898

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count：

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 4

Affiliated Colleges：

Get Fulltext

Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to