News for hackers. Stuff that matters.

A comment on When Big O Fools You.

Re:When Big O Fools You by lziest on Tuesday August 23, 2016 @02:42PM (#12346310)
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.

[ Parent | on HN ]
Re:When Big O Fools You by Guvante on Tuesday August 23, 2016 @04:12PM (#12347135)
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".

[ Parent | on HN ]