计算机科学 ›› 2009, Vol. 36 ›› Issue (6): 235-238.

• • 上一篇    下一篇

基于概念的折半查找算法

  

  • 出版日期:2018-11-16 发布日期:2018-11-16

  • Online:2018-11-16 Published:2018-11-16

摘要: 自顶向下或自底向上两种标准查找方式不适合于具体领域逻辑,且缺乏灵活性。模拟有序数组中的折半查找,提出逻辑空间上的折半查找方法,证明该查找方法在保持完备性和非冗余性的同时,还提供了更好的灵活性,最后给出了该查找的通用算法,并分析其复杂性。

关键词: 逻辑信息系统 折半查找 算法 复杂性

Abstract: The standard strategies of top-down and bottom-up search are ill-suited to domain specfic logics, and lack flexibility. This paper therefore introduced a binary search strategy, that is analogous to a binary search in an ordered array. We proved this prov

Key words: Logic information system, Binary search, Algorithm, Complexity

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!