Millionaire Mode

Computer Science Theory

Question 1 of 15

Which sorting algorithm has a worst-case time complexity of O(n^2) but a best-case time complexity of O(n)?

  1. Bubble Sort
  2. Merge Sort
  3. Quick Sort
  4. Heap Sort

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