Which of the following statements about Big O notation is FALSE? A. An O(n) algorithm's run time (in seconds) will ALWAYS be fas

Question

4 years ago

11

Which of the following statements about Big O notation is FALSE? A. An O(n) algorithm's run time (in seconds) will ALWAYS be fas

ter than an O(n^2) algorithm's run time B. You cannot sort an ArrayList faster than O(n log n) C. Constant time is O(1) D. An algorithm that takes 3n + 5 steps has the same complexity class as an algorithm that takes 4n + log(n) steps.

Social Studies

1 answer:

SpyIntel [72] · Answer 1 · 2022-02-25T10:15:33+03:00

SpyIntel [72]4 years ago

7 0

Answer:

The answer is letter C

Explanation:

Constant time is O(1).

Because it is not a valid runtime according to Big O notation.