Computer Science · Algorithms & Complexity
Match the following algorithms with their correct average-case time complexities: Wikipedia + 1 I. Binary search 1. O(n2) II. Quick sort 2. O(log n) III. Linear search 3. O(n log n) IV. Selection sort 4. O(n)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1I - 4; II - 3; III - 2; IV - 1
- 2I - 2; II - 3; III - 4; IV - 1✓
- 3I - 1; II - 4; III - 2; IV - 3
- 4I - 3; II - 1; III - 2; IV - 4
Correct answer
I - 2; II - 3; III - 4; IV - 1
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms & Complexity MCQs →Want more practice questions on Algorithms & Complexity?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms & Complexity