ProGrads 卷別
資料結構
選擇國立中央大學 2026 · 考試 · 第 15 題
If writing to memory (Write/Swap) is very expensive (e.g., Flash Memory), we want to minimize the number of writes. Which of the following algorithms guarantees the fewest number of writes?
- (A)Selection Sort
- (B)Cycle Sort
- (C)Heap Sort
- (D)Quick Sort