Problem
Find time complexity for the following recurrence equations using Substitution and Recurrence Tree methods:
T(n) = 4T(n/2) + n2. T(1) = 1
T(n) = 4T(n/2) + 1. T(1) = 1
T(n) = 3T(n/2) + n2. T(1) = 1
Find time complexity for the following recurrence equations using Master method:
T(n) = 4T(n/2) + logn
T(n)=16T(n/4) + n
T(n) = 2T(n/2) + nlogn
T(n) = 4T(n/2) + cn + n2