Multiple Choice
Q(lg n) , Q(n) and Q(n²) are ____ in the amount of work they do as n increases.
A) restricted
B) useful
C) polynomially bounded
D) exponential
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q6: What is the logarithm of n to
Q9: A(n) _ is a path through a
Q19: The study of the efficiency of algorithms
Q20: What is the definition of order of
Q22: With sequential search, the <u>bigger</u> the list
Q29: Discuss at length the measurement of the
Q29: The time an algorithm takes on a
Q42: Selection sort is a(n) _ algorithm in
Q45: Discuss at length how binary search operates.
Q46: The worst case in binary search occurs