Is it Polynomial time algorithm

Question

If an algorithm's input size is 2^n and the algorithm runs in $O(n2^n)$ time. In this case, can we say that the algorithm runs in polynomial time with respect to input size?

Answer 1

Yes, that would be an O(k log k)-time algorithm, where k = 2^n.