Below is an excerpt from Khan Academy's Quick Sort Analysis page.
In the average case of quicksort they assume that each time the partition function breaks the input array into the ratio 1:3 each time.
So why is it easier to assume $\log_4 n$ levels when the $n$ elements are being partitioned ? Why not assume it to be $\log_2 n$ levels ?
Wouldn't $\log_4 n$ and $\log_2 n$ mean the same thing here ?