I'm researching the different execution time of various sorting algorithms and I've come across two with similar times, but I'm not sure if they are the same.
Is there a difference between $\log n$ and $\log^2 n$?
Follow up question: in terms of complexity , which would be faster, $O(\log n)$ or $O(\log^2 n)$? My guess would be the first one. (Note, this is not homework, I'm just trying to understand the difference between quicksort and bitonic sort on a hypercube topology. )