ProGrads 卷別
資料結構與演算法
選擇國立臺灣大學 2026 · 考試 · 第 13 題
考科演算法
(4 points) Which algorithm guarantees finding the median (the -th order statistic) of an array of elements in worst-case time?
- (A)Sorting the array and then picking the median.
- (B)Quickselect using random pivots.
- (C)Using a max-heap or min-heap of size .
- (D)The median-of-medians selection algorithm.
- (E)None of the other choices.