Divide and conquer recurrence relation
You need to define first where the recursion ends. And what t(n/4) means if n is not a multiple of 4.
The likely outcome will be that t(n) for 4^k &lt; n &lt; 4^(k+1) is between t(4^k) and t(4^(k+1)).