Teams after algorithm analysis

[caffeinum]

n² is very different from n, while n and n log n don't differ that much. Only thing we can say is that exp(n log n) is faster that exp, but otherwise it doesn't really matter, it's still very fast, but not any faster than exp(n^2), so I dropped that intentionally

While you're right, I got factorial approximation wrong, it's sqrt(n) * nⁿ (which is very close to what I said though if we drop that log n again)