問題詳情
III For questions with sequences, we constantly split the problem into a number of sub-problems thatare smaller instances of the same problem, and we try to solve the smaller problems recursively. Wecalled this type of algorithm __(6)__
(A) Dynamic programming
(B) Divide and Quicksort
(C) Greedy al- gorithms
(D) conquer
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增