基于折半查找算法的研究与改进

Research and Improved Based on the Bisearch Algorithm

折半查找算法是数据结构中有序序列查找中的一个重要算法,可以用比折半法改进的折半法查找性能,明显优于折半查找,在实际应用中可极大提高查找效率。

Bisearch algorithm is a important search one in the sequence of data structure,which most cyclic compared time is log2 n」+1 when algorithm searches a special element among some ones.But,some information is already known in many circumstance,such as:a upper bound of the maximum difference between adjacent element in the array.Then,a preferable algorithm can be designed.The improved bisearch algorithm is better than the old one in the performance of searching.Under the array distributing effect,in the worst case,the maximum times of comparison is between 1 and log2 n」+1 at the time of searching special element.The performance efficiency is obviously improved at applications.