Multiple Choice
The constant big-O value is ____.
A) O(1)
B) O(n)
C) O(log n)
D) O(n log n)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q34: sum(n) =n+sum(n-1), where n>1 is an example
Q35: Given a recursive definition of some process,
Q36: The logarithmic big-O value is _.<br>A) O(1)<br>B)
Q37: A _ sort algorithm computes the middle
Q38: Identify the letter of the choice that
Q40: A(n) _ algorithm is one that refers
Q41: In a quicksort algorithm, the middle of
Q42: sum(n) =1+2+3+...+n, where n>1 is an example
Q43: The _ search algorithm is O(log n).<br>A)
Q44: _ is an extra array used during