What is the time complexity for searching a key or integer in Van Emde Boas data structure?

Category: QuestionsWhat is the time complexity for searching a key or integer in Van Emde Boas data structure?
Editor">Editor Staff asked 1 month ago

What is the time complexity for searching a key or integer in Van Emde Boas data structure?
 
(a) O (log M!)
 
(b) O (M!)
 
(c) O (M^2)
 
(d) O (log (log M))
 
Question is from Trees in division Trees of Data Structures & Algorithms I
 
I had been asked this question in an interview for internship.

1 Answers
Editor">Editor Staff answered 1 month ago

Right choice is (d) O (log (log M))
 
For explanation: In order to search a key or integer in the Van Emde Boas data structure, the operation can be performed on an associative array. Hence, the time complexity for searching a key or integer in Van Emde Boas data structure is O (log (log M)).