Computer Science · Algorithms
Match List-I (Algorithm) with List-II (Recurrence relation) for time complexity analysis: List-I (Algorithm) (A) Binary Search (B) Merge Sort (C) Quick Sort (worst-case partitioning) (D) Linear Search List-II (Recurrence relation) (I) T(n) = T(n / 2) + c (II) T(n) = 2T(n / 2) + Θ(n) (III) T(n) = T(n - 1) + Θ(n) (IV) T(n) = T(n - 1) + c (where c is a constant) Choose the correct match option:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
- 2(A) - (I), (B) - (II), (C) - (IV), (D) - (III)
- 3(A) - (I), (B) - (III), (C) - (II), (D) - (IV)
- 4(A) - (I), (B) - (II), (C) - (III), (D) - (IV)✓
Correct answer
(A) - (I), (B) - (II), (C) - (III), (D) - (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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms