Question

Explain the best case, average case and worst case time complexities for the insertion of a new element in an array of size n by taking suitable example.

Answer 1

Explanation:

The worst-case complexity of the algorithm is the function defined by the maximum number of steps taken on any instance of size n. It represents the curve passing through the highest point of each column.

Plz Mark me as BRAINLIEST

Answer 2

Answer:

We can have three cases to analyze an algorithm:

1) Worst Case

2) Average Case

3) Best Case