Question

Discuss best case, average case and worst case time analysis with example.

Answer 1

Answer:

Best case = fastest time to complete, with optimal inputs chosen. ... Worst case = slowest time to complete, with pessimal inputs chosen. For example, the worst case for a sorting algorithm might be data that's sorted in reverse order (but it depends on the particular algorithm). Average case = arithmetic mean.

Explanation:

please mark me as brainleist answers and please follow me I Will also follow you friends