Time Complexity Analysis

Master Theorem

Dividing $N$ sized problem into $a$ subproblems of size $\frac{N}{b}$ each in $O(f(n))$ time, would result in equation [Ref]

$T(n) = a.T(\frac{N}{b}) + f(n)$

SECTION INCOMPLETE: Write full theorem and solutions here from wiki article