Multiple Choice
Big O notation describes ________.
A) the amount of memory required by an algorithm.
B) the difficulty of writing an algorithm to solve a specific problem.
C) an algorithm's efficiency in terms of the work required to solve a problem.
D) the length of an algorithm for solving a specific problem.
Correct Answer:
Verified
Correct Answer:
Verified
Q1: What is the efficiency of linear search?<br>A)O(1).<br>B)O(log
Q2: An O(n)algorithm is referred to as having
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