一种基于区间约束的折半查找算法

A BINARY SEARCH BASED ON RANGE RESTRAINT

针对变化范围很大而又相对稳定的查找对象 ,给出一种基于区间约束的折半查找算法 .当后一个查找对象在前一个查找对象附近时 ,在最坏状态和平均状态下 ,该算法与标准的折半查找算法比较 ,其查找长度均显著减少 ,而且代价很小 .此算法适合用于类似过程控制中的对低频信号的实时查表处理 ,并在国家级新产品 WPJ- 3微机频率事故记录装置和 WQP-

A modified binary search algorithm is given in this paper. When the ordered list is long and the item to be accessed is near the prior one, the new algorithm with very little cost gives much less path length than the old one under the worst condition and the average condition. This algorithm is useful for real time searching when applied to discrete low frequency signal in the area of process control.