Big-O Notation (Part II)
In this article, we continue to explore Big-O, which is a notation we use to describe algorithmic efficiency. If you haven’t read part one, you might like to read that part first. In the last article we talked about where Big-O notation came from, and what notation we might expect to discover for an efficient... » read more