Difference between $\log n$ and $\log^2 n$ 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$?

EDIT:

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.
)
$(\log(n))^2$ means $\log^2(n)$
O(log^2 N) is faster than O(log N) because of 

O(log^2 N) = O(log N)^2

           = O(log N * log N)


Therefore Complexity of O(log^2 N) > O(log N).

Just take n as 2, 4, 16;

          O(log^2 N)         O(log N)

2  --&gt;     1^2 = 1               1
4  --&gt;     2^2 = 4               2
16 --&gt;     4^2 = 16              4