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.

The best-case time complexity of an algorithm is O(1). What does this mean?

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

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.

An algorithm iterates 10 times for an input of size n. What is the best-case time complexity?Group of answer choicesO(n)O(1)O(n^10)O(log n)

Big Θ (theta) notation represents theGroup of answer choicesLower bound of an algorithm's time complexity.All of the above.Average-case time complexity of an algorithm.Upper bound of an al