Which of the following statements is FALSE about Big O notation?Group of answer choicesIt can be used to compare the efficiency of different algorithmsIt ignores constant factors.It considers only the dominant/leading term as the input size grows.It represents the worst-case time complexity.

If an algorithm has a time complexity of O(n^2), which of the following input sizes will cause the running time to increase the most?Doubling the input sizeTripling the input sizeHalving the input sizeKeeping the input size constantClear ResponseSave & Next

he best-case time complexity of an algorithm is O(1). What does this mean?Group of answer choicesThe algorithm has a linear time complexity.The algorithm takes one unit of time irrespective of the input size.The running time of the algorithm is independent of the input size.The algorithm performs best when the input is sorted.

If an algorithm's time complexity is O(n2 log n), which of the following best describes its efficiency compared to an algorithm with a time complexity of O(n2)?Group of answer choicesIt is less efficient.It is equally efficient.It depends on the specific input data.It is more efficient.

When comparing two algorithms with time complexities O(n) and O(n2), which one is more efficient for large inputs?Group of answer choices

If f(n) = O(g(n)), which of the following statements is true?g(n) grows faster than f(n) as n increasesf(n) grows faster than g(n) as n increasesf(n) and g(n) grow at the same rate as n increasesNone of the above