hashtable question

for an open-adressing has table using linear probing for collision resolution, what is the average time complexity to find an item with a given key?

also same question but double probing instead

from my understanding my answer to the first question would be O(n)
but im not sure about the double probing question
Topic archived. No new replies allowed.