卷別

資料結構與演算法(A)

選擇

國立臺灣大學 2022 · 考試 · 第 13 題

(5 points) Consider a hash table with $f(n)$ entries with a hash function that can uniformly dispatch items to those entries. Which property below ensures that a successful search can be done in $O(1)$ ?

(A)
$f(n) = O(\sqrt{n})$
(B)
$f(n) = O(n)$
(C)
$f(n) = \Omega(\sqrt{n})$
(D)
$f(n) = \Omega(n)$
(E)
none of the other choices

標準解析

AI 生成