I couldn't wrap my head around for finding an example for the following recurrence.
$T(n) = a T(n/b) + f(n)$ where $a \neq b$ and $b > 1$
If we divide n elements with b, it should give us a sublists each with size n/b
Could somebody please give me a practical example of this?