好，还有没有关于二分搜索的问题？
在分析二分搜索方法基础上，提出了一种新的搜索方法。
Based on the analysis of binary search method, a new search method is put forward.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
去学习的二分搜索是有联系的，这种方法的基础思想，是我们有一个线性的序集， 我们也明白答案在其中的某一段区间。
And the basic idea was that we had some sort of a line and we knew the answer was somewhere between this point and this point.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
百度在中国网络搜索占有超过60%的市场份额，而谷歌中国只持有其二分之一多些的市场。
Baidu holds over 60% of the market share in Internet search in China, while Google. cn holds a little over half of that.
如果采用诸如二分法搜索的快速搜索方法，则可实现更快的搜索。
If a fast search method such as binary searching is adopted, much faster searching can be realized.
如果采用诸如二分法搜索的快速搜索方法，则可实现更快的搜索。
If a fast search method such as binary searching is adopted, much faster searching can be realized.
应用推荐