Which of the following statements about running times of algorithms is correct?
A) An algorithm that is O(1) means that only one comparison takes place.
B) When determining the running time, constants are not taken into consideration.
C) When determining the running time, lower-order terms must be taken into consideration.
D) An algorithm that is O(n) means that the number of comparisons does not grow as the size of the array increases.

Question

Quizplus · Accepted Answer

When determining the running time, constants are not taken into consideration because Big O notation focuses on the growth rate as input size increases, ignoring constant factors and lower-order terms.

Which of the Following Statements About Running Times of Algorithms