Which of the following cases does NOT exist while calculating time complexity?

Explanation

The correct option is (3) Explanation:- The null case does not exist while calculating time complexity. Time complexity:- The time complexity, measured in the number of comparisons. In other words, the time complexity is essential, efficiency, or how long a program function takes to process a given input. Additional Information Average case:- In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource used by the algorithm, averaged over all possible inputs. Best case:- The number of operations in the best case is constant (not dependent on n). So time complexity in the best case would be 0(1). Most of the time, we do worst-case analysis to analyze algorithms. Worst case:- In the worst-case analysis, we calculate the upper bound on the running time of an algorithm. We must know the case that causes a maximum number of operations to be executed.