Are you referring to the fact that Big O has notation and concepts revolving aro... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		lordleft 11 days ago \| parent \| context \| favorite \| on: A visual introduction to big O notation 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?

umanwizard 11 days ago [–]

It 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)).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact