Python , Big O notation Specifically made mention of big O (what is big O):

Which runs faster : n * 2^{n} OR nlog(n)

And why? How in determining which codes run faster or slower.. Have a feeling it might be the first but something that I wrote in my notes makes me skeptical of that.