algorithms
Divide and Conquer(Main Thoery)
if a>=1 and b > 1, T(n) = aT(n/b) + f(n)
case 1 \[ f(n) = O(n^{\log_b{a-\epsilon}}) \longrightarrow T(n) = \Theta(n^{\log_ba}) \]
- case 2 \[ f(n) = \Theta(n^{\log_ba}) \longrightarrow T(n) = \Theta(n^{\log_ba}\lg n) \]