Question

What is the time complexity in Big-Oh notation for \[ f(n)=a_{m}n^{m}+\cdots+a_{1}n+a_{0}? \]

• A. \(O(n^2)\)
• B. \(O(n^3)\)
• C. \(O(2^n)\)
• D. \(O(n^m)\)

Hint:

For polynomial functions, Big-Oh complexity is determined by the highest power of \(n\). Example: \[ 5n^4+2n^2+10 \] has complexity \[ O(n^4). \]

Answer 1

The Correct Option is D