Question: is log n polynomial time?
Answer: Polynomial-Time Algorithms. A polynomial-time algorithm is an algorithm whose execution time is either given by a polynomial on the size of the input, or can be bounded by such a polynomial. ... Although n log n is not, strictly speaking, a polynomial, the size of n log n is bounded by n2, which is a polynomial.