Question

distinguish between worst-case
running time and best-case running time in
algorithm analysis; and give relevant practical
examples to illustrate your answer

Answer 1

Answer:

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.

Explanation:

The best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or other resource.

Answer 2

Answer:

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 case is the function which performs an average number of steps on input data of n elements.

Explanation:

h

Hope its help for You.