Computer Science · Data Structures and Algorithms
Match the following algorithms with their correct time complexities: (A) Breadth-First Search — (I) θ(V + E) (B) Rabin-Karp Algorithm — (II) O(V + E) (C) Depth-First Search — (III) θ((n - m + 1)m) worst-case (D) Heap sort (worst case) — (IV) O(n2) (E) Quick sort (worst case) — (V) O(n log n)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)
- 2(A)-(II), (B)-(III), (C)-(I), (D)-(V), (E)-(IV)✓
- 3(A)-(II), (B)-(III), (C)-(I), (D)-(IV), (E)-(V)
- 4(A)-(III), (B)-(II), (C)-(I), (D)-(IV), (E)-(V)
Correct answer
(A)-(II), (B)-(III), (C)-(I), (D)-(V), (E)-(IV)
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms