log (n) ^ a is always O (n ^ b), for any positive constants a, b.
Are you looking for evidence? All such problems can be reduced to the fact that log (n) - O (n), with the following trick:
log (n) ^ a = O (n ^ b) is equivalent to: log (n) = O (n ^ {b / a}), since increasing to the power of 1 / a is an increasing function. This is equivalent to log (m ^ {a / b}) = O (m), setting m = n ^ {b / a}. This is equivalent to log (m) = O (m), since log (m ^ {a / b}) = (a / b) * log (m).
You can prove that log (n) = O (n) by induction by focusing on the case where n is a power of 2.
source share