二分搜索
网络释义专业释义
-
binary search - 引用次数：17
Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
参考来源 - 基于多项式根最大模求解的二分搜索算法bisearch - 引用次数：1 参考来源 - 基于二分搜索Trie的IPv4/IPv6路由快速查找算法 in C -
dichotomizing searchbinary search
·2,447,543篇论文数据，部分数据来源于NoteExpress
双语例句原声例句
-
好，还有没有关于二分搜索的问题？
-
在分析二分搜索方法基础上，提出了一种新的搜索方法。
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.
-
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.
去学习的二分搜索是有联系的,这种方法的基础思想,是我们有一个线性的序集,我们也明白答案在其中的某一段区间。
-
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
-
I'm going to call it down here with search, which is simply going to call it, and then print an answer out.
然后返回答案，在二分法搜索中，其实有个挺美妙的名称。
应用推荐