Θ(lg n ), Θ( n ), and Θ( n ²)are ____ in the amount of work they do as n increases. A)restricted B)useful C)polynomially bounded D)exponential

Question

Quizplus · Accepted Answer

The notation Θ(n^k) for any constant k > 0 (including Θ(n), which is when k=1) and Θ(log n) are all examples of polynomially bounded complexities, indicating that their growth rates are bounded by a polynomial function of n. The term "Θ(n ²)" seems to be a formatting error, but assuming it intended to represent a polynomial function, it would also be polynomially bounded.

Θ(Lg N ), Θ( N ), and Θ( N 2)are

Θ(Lg N ), Θ( N ), and Θ( N ²)are