Question

1.what is best case?
2.average case?
3.worst case ? ​

Answer 1

Explanation:

1 ) best case : Best case is the function which performs the minimum number of steps on input data of n elements. Worst case is the function which performs the maximum number of steps on input data of size n. ... Average performance and worst-case performance are the most used in algorithm analysis.

2) 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. It is frequently contrasted with worst-case complexity which considers the maximal complexity of the algorithm over all possible inputs.

3)worst case : Worst case is the function which performs the maximum number of steps on input data of size n. ... In real-time computing, the worst-case execution time is often of particular concern since it is important to know how much time might be needed in the worst case to guarantee that the algorithm will always finish on time.