Multiple Choice
What is the efficiency of linear search?
A) O(1) .
B) O(log n) .
C) O(n) .
D) O(n2) .
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: An O(n)algorithm is referred to as having
Q3: Big O notation describes _.<br>A)the amount of
Q3: Which of the following statements is true?<br>A)
Q6: Which of the following sorting algorithms is
Q7: What is the efficiency of selection sort?<br>A)O(n2).<br>B)O(n
Q8: What is the term used for binary
Q9: What does the first pass of selection
Q10: A searching algorithm that's O(1)_.<br>A)requires one comparison<br>B)does
Q11: Big O notation is concerned with the
Q20: Which of the following is not a