No.<p>Just as (e^n) grows <i>faster</i> (in the limit) than any polynomial of n, such as n^2 or n^100; likewise, log(n) grows <i>slower</i> than any polynomial of n, such as sqrt(n) = n^(1&#x2F;2), or even n^(1&#x2F;100).<p>They are both practically pretty slow-growing, though. It may well be that for practical sizes, constant factors matter more than the asymptotic difference on present computers.