演算法›Ch2 分治法
第 5 題/共 12 題
◀ AL 5/12
5. Divide and Conquer、定義
#AL-02-005易Divide and Conquer定義

For questions with sequences, we constantly split the problem into a number of sub-problems that are smaller instances of the same problem, and we try to solve the smaller problems recursively. We called this type of algorithm

📄 台大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch2 分治法
本章題號 · 1–12 / 12