+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (737k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...