ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 2 題
考科演算法
(3 points) Which of the following sorting algorithms has the best worst-case time complexity?
- (A)Bubble Sort
- (B)Merge Sort
- (C)Insertion Sort
- (D)Selection Sort
← 回題庫