申論題

8.(5%) We have an open addressing hash table of size 7 to store integer keys, with hash function h(x) = x mod 7. Assume we use linear probing for collision resolution and insert elements in the order 1, 15,14,3,9,5,27.

(2). What is the worst-case time complexity for searching in a hash table of size N _____