最坏情况下使用O(n)次比较,2分搜索算法最坏情形复杂度O(logn)次比较,2分搜索算法比之线性搜索最坏情况下要好.-O (n) comparisons using the worst case, worst-case 2 minutes searching algorithm complexity of O (logn) comparisons, two points lower than the linear search algorithm search for the worst-c