Why the time complexity O ( N*Log( N ) ) is considered polynomial time?

Question

Why the time complexity O ( N*Log( N ) ) is considered polynomial time?

In: Mathematics

Answer 1

In short: polynomial time complexity is any complexity function that can be bound by a polynomial function. log(N) < N (for large values of N), so N*log(N) can be bound by the polynomial function N^(2), making it polynomial time.