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] Unfold

Indexed by：

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

Algorithms Binary sequences Computational complexity Data storage equipment Data structures

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

Show more details

Version：

Binary search algorithm on the path of a heap
1996，Journal of Software

A new variant of in-place sort algorithm
2012，2012 International Workshop on Information and Electronics Engineering, IWIEE 2012
A new technique for computational complexity analysis
2010，
Backtracking algorithm for grid scheduling of independent tasks
2006，Acta Scientiarum Natralium Universitatis Sunyatseni
Detection and protection of short circuit fault based on morphology-wavelet
2005，2005 IEEE/PES Transmission and DistributionConference and Exhibition - Asia and Pacific

Source ：

Journal of Software

ISSN： 1000-9825

CN： 11-2560/TP

Year： 1996

Issue： 1

Volume： 7

Page： 41-44

Cited Count：

WoS CC Cited Count：

30 Days PV： 4

Affiliated Colleges：

数学与统计学院本学院/部未明确归属的数据

Get Fulltext

Library Discovery Baidu Scholar Search Engineering Village

Type
Departments

All Years Choose Year From to