In the most ideal situation, searching a table using hashing technology results in a time complexity of

$O(nn)$

$O(1)$

$O(n)$

$O(log(n))$