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

Big O notation is asymptotic. Using only 5 insertions to understand Big O is definitely the wrong way. For example, insertion sort works better when the array is small, but insertion sort is definitely O(n^2), worse than qsort.

Don't let Big O notation fool you, don't misunderstand Big O.




Inserts in that chart is the ratio of inserts to reads.

5 means "write five times then read once per iteration" not "write five times".




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

Search: