Question Bank

Master Theorem Deep Dive

Difficulty: Hard

Five prompts on T(n) = a*T(n/b) + f(n): identifying the three cases, applying them to merge sort and Strassen, and spotting when the theorem does not apply.

Question Bank
/

Master Theorem Deep Dive

Master Theorem Deep Dive

Five prompts on T(n) = a*T(n/b) + f(n): identifying the three cases, applying them to merge sort and Strassen, and spotting when the theorem does not apply.

Question Bank
Hard
Python
master-theorem
recursion
big-o
algorithms

888 views

24

This question bank is available for premium members only.

Upgrade to Premium