Edit Complexity Notation in #352

[dovisutu]

Fixing problems in #352 about Complexity Notation Chapter

• adding O != Omega example
• Using println as an operation
• fixing the overflow problem in exponational algorithm
• Using a real logarithmic algorithm and edit the explanation

[leios]

This is a quick fix for the problem at-hand and I don't mind merging it. The main thing is that this chapter goes against the philosophy of all other "code" in the AAA and only has julia-esque pseudocode instead of actual code in other languages. I suppose I need to re-write this so it allows for real methods to be written in whatever language instead of using weird println() statements.

[Amaras]

As I'm now going through the backlog, I don't mind merging it as well, like @leios said a long time ago, if that's still the case for him.
I have a few Eglish language-related changes to make, so I won't approve yet.

[Amaras]

From there, I'll merge this chapter edit, since it has been too long since the last review that asked for simple text changes.