Hacker News new | past | comments | ask | show | jobs | submit login

Big O notation is frequently used to refer to the average case bounds of an algorithm. Haven't you seen an analysis of quicksort?



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

Search: