ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 15 題
考科資料結構
(3 points) Consider a hash table implemented with open addressing (linear probing). If the load factor is close to 1, which of the following is most likely to occur?
- (A)Decreased collision frequency
- (B)Improved average search time
- (C)Increased average number of probes per search
- (D)No significant impact on performance