卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 3 題
考科演算法
(3 points) You are designing a program to compute the maximum achievable value from a limited set of resources with constraints. Which of the following techniques would you use to solve this problem most efficiently?
- (A)Greedy approach
- (B)Graph traversal algorithms
- (C)Divide and conquer
- (D)Dynamic programming