I’m looking at the table given on this site: https://www.bigocheatsheet.com/
For the data structures, it has a group of time complexities for the Average and Worst case. Same thing for the algorithms.
My question is, when do these cases actually occur and are they different for different data structures / algorithms.
When is it a best case as opposed to the worst case? For example I know quicksort has worst case when it is nearly sorted.
New contributor
Unique User is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
6