卷別
資料結構與演算法(A)
選擇國立臺灣大學 2021 · 考試 · 第 6 題
考科演算法
(5 points) 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?
- (A)Dynamic programming
- (B)Divide and conquer
- (C)Greedy algorithms
- (D)Quicksort