AKA 분할정복법,
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

분할 정복법
https://brilliant.org/wiki/divide-and-conquer/

MKLINK
알고리듬,algorithm
문제,problem
부분문제 부문제 subproblem ... subproblem x subproblem subproblem
해,solution
merge_sort
binary_search
Karatsuba_algorithm - Karatsuba

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

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