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
Q12: Big O notation is concerned with the
Q13: An O(n) algorithm is referred to as
Q14: How much faster is insertion sort with
Q15: What is the term used for binary
Q16: What is the efficiency of selection sort?<br>A)
Q17: Using a binary search, what is the
Q18: How many comparisons will the linear search
Q19: Different sorting algorithms on a particular array
Q20: Which of the following is not a
Q22: A searching algorithm that's O(1)_.<br>A) requires one