# What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?

Category: QuestionsWhat is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?
Editor">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

Editor">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).

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702