Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?
(a) O (log M!)
(b) O (M!)
(c) O (1)
(d) O (log (log M))
My doubt stems from Trees in section Trees of Data Structures & Algorithms I
I had been asked this question in an interview for job.
1 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
The correct option is (c) O (1)
Easy explanation – In order to find a maximum or minimum integer in the Van Emde Boas data structure, the operation can be performed on an associative array. Hence, the time complexity for finding a maximum or minimum integer in Van Emde Boas data structure is O (1).
