This paper presents a binary search algorithm on the path of a heap. If a heap is used to realize priority queue, logn+a3(n) + 1 comparisons are sufficient to replace the maximum element in the heap by the algorithm.
1 顾训穰,诸字章.堆整序的最优算法.软件学报,1994,5(1):33~36.
2 顾训穰,诸字章.堆整序的改进算法及其复杂性分析.计算机学报,1990,13(4):289~292.
3 A V Aho,J E Hopcroft,J D Ullman.Data structures and algorithms.Addison—Wesley,Reading,Mass, 1983.238~239.