Algorithms in plain English: time complexity and Big-O notation
Michael Olorunnisola
1.3K27

I think you missed the O(nlog(n)) complexity, which is the most frequently occurring when you deal with sorting stuff.

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.