We might talk about polynomial time like that's reasonable, but few useful algorithms are worse than X^2 * log x.
After all, the man issue is not the size of the algorithm but how long f(N) takes and all to often we see N > 1,000,000,000 which limits what's reasonable.