binary divide
常见例句
- Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean?
好了，二分搜索也许是,最简单的分治算法，这意味着什么？ - The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。 - 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.
好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
麻省理工公开课 - 计算机科学及编程导论课程节选 返回 binary divide