Computer Science · Algorithms
Match the following algorithms with their corresponding recurrence relations for time complexity: List I (Algorithm) A. Insertion sort (Worst case) B. Heap sort C. Merge sort D. Binary search List II (Recurrence Relation) I. T(n) = 2T(n/2) + O(n) II. T(n) = T(n/2) + k III. T(n) = T(n - 1) + log2(n) IV. T(n) = T(n - 1) + n
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - IV, B - III, C - I, D - II✓
- 2A - I, B - III, C - IV, D - II
- 3A - IV, B - II, C - I, D - III
- 4A - IV, B - III, C - II, D - I
Correct answer
A - IV, B - III, C - I, D - II
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