Details notes on best case analysis in data structure
Answers
Answered by
0
Answer:
Explanation:
In the simplest terms, for a problem where the input size is n: Best case = fastest time to complete, with optimal inputs chosen. For example, the best case for a sorting algorithm would be data that's already sorted. Worst case = slowest time to complete, with pessimal inputs chosen.
Similar questions