微信服务号

微信订阅号

Home > Archive>Volume 7, Issue 1, 1996 >41-44
PDF HTML XML Export Cite reminder
A BINARY SEARCH ALGORITHM ON THE PATH OF A HEAP
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

王晓东,傅清祥,范庆,王梅集.堆的路径二分搜索算法.软件学报,1996,7(1):41-44

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 17,1994
  • Revised:December 12,1994
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063