Binary search algorithm on the path of a heap - Details

author：

Wang, Xiaodong (Wang, Xiaodong.) ^[1] | Fu, Qingxiang (Fu, Qingxiang.) ^[2] | Fan, Qing (Fan, Qing.) ^[3] | Wang, Meiji (Wang, Meiji.) ^[4]

Indexed by：

Scopus PKU CSCD

Abstract：

This　paper　presents　a　binary　search　algorithm　on　the　path　of　a　heap.　If　a　heap　is　used　to　realize　priority　queue,　logn+α3(n)+1　comparisons　are　sufficient　to　replace　the　maximum　element　in　the　heap　by　the　algorithm.

Keyword：

Community：

[ 1 ] Wang, Xiaodong, Fuzhou Univ, Fuzhuo, China
[ 2 ] Fu, Qingxiang, Fuzhou Univ, Fuzhuo, China
[ 3 ] Fan, Qing, Fuzhou Univ, Fuzhuo, China
[ 4 ] Wang, Meiji, Fuzhou Univ, Fuzhuo, China

Reprint 's Address：

[Wang, Xiaodong]Fuzhou Univ, Fuzhuo, China

Email：

Show more details

Related Keywords：

Source ：

Journal of Software

ISSN： 1000-9825

Year： 1996

Issue： 1

Volume： 7

Page： 41-44

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： 1

Affiliated Colleges：

Get Fulltext

Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to