Multiple Choice
What is the best case performance of a sequential search?
A) O n
B) linear
C) quadratic
D) O(1)
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q20: What is the complexity of a selection
Q21: What should the missing code be in
Q22: Which of the following is a method
Q23: In the following code, what is the
Q24: Which method of determining the efficiency of
Q26: In the first step of the quicksort,
Q27: What should the missing code be in
Q28: In terms of complexity, what is the
Q29: A bubble sort always requires approximately n<sup>2</sup>
Q30: Algorithms with linear behavior do more work