4 ms·
Are you referring to the fact that Big O has notation and concepts revolving around best-case/average case scenarios, as well as worst-case scenarios?
by lordleft 1y ago
Are you referring to the fact that Big O has notation and concepts revolving around best-case/average case scenarios, as well as worst-case scenarios?
- School-Cotton 1y agoIt is the same notation in either case. The worst-case runtime of quicksort is O(n^2). The average runtime is O(n * log(n)).