ぶんかつとうちほう
分割統治法
1. divide and conquerComputing
2. Divide and conquer algorithmIn computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.
Read “Divide and conquer algorithm” on English Wikipedia
Read “分割統治法” on Japanese Wikipedia
Read “Divide and conquer algorithm” on DBpedia
Read “Divide and conquer algorithm” on English Wikipedia
Read “分割統治法” on Japanese Wikipedia
Read “Divide and conquer algorithm” on DBpedia
Discussions
Log in to talk about this word.