Match List – I with List II. f(n) = a f(n/b)+g(n) is a divide-and-conquer…
Match List – I with List II. f(n) = a f(n/b)+g(n) is a divide-and-conquer recurrence relation for the Listed-I algorithms, match their recurrence in Listed-II.
List – I
Divide-and-conquer based algorithms
A. Binary Search
B. Find the maximum and minimum of a sequence
C. Merge Sort
D. Fast Matrix Multiplication
List – II
Recurrence Relation
I. f(n)=7f(n/2)+15 n²/4
II. f(n)=2f(n/2)+n
III. f(n)=2f(n/2)+2
IV. f(n)=f(n/2)+2
Choose the correct answer from the options given below:
- A.
A-I, B-II, C-III, D-IV
- B.
A-II, B-III, C-IV, D-I
- C.
A-III, B-IV, C-I, D-II
- D.
A-IV, B-III, C-II, D-I
Attempted by 7 students.
Sign up free to check your answer
Sign up freeLoading lesson…

