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