[关键词]
[摘要]
本文提出堆的路径二分搜索算法．当用堆来实现优先队列时，此算法可用较少的比较次数完成插入及删除最大元素等操作．
[Key word]
[Abstract]
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.
[中图分类号]
[基金项目]
本文研究得到福建省自然科学基金和国家教委留学回国人员资助费支持.
