Millionaire Mode

Test 1 Algorithms | Computer Science

Question 1 of 20

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time

  1. O(n log n)
  2. O(n)
  3. O(log n)
  4. O(1)

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000