AKA '''분할정복법,'''
## from 석준희강의
Break up a problem into separate subproblems, solve each independently, and combine solutions to form the solution of original problem.

Examples:
FFT - fast [[푸리에_변환,Fourier_transform]]

[[Namu:분할%20정복법]]
https://brilliant.org/wiki/divide-and-conquer/

MKLINK
[[알고리듬,algorithm]]
[[문제,problem]]
부분문제 부문제 subproblem ... Ndict:subproblem x Naver:subproblem Ggl:subproblem
 overlapping_subproblem
[[해,solution]]
[[merge_sort]]
[[binary_search]]
[[Karatsuba_algorithm]] - Srch:Karatsuba

... Google:분할정복법 Google:divide.and.conquer

분류는.. [[방법,method]]? [[기법]]? [[technique]]? [[알고리듬,algorithm]]? ([[문제,problem]]의) 해법?([[해법]] ... Ndict:해법 - rel. [[해,solution]])