Fantastic overview of computational complexity. Sure, there are a few obvious typographical errors, but the content is there and the ideas are conveyed clearly. If you already are a little familiar with Big Oh notation but are not readily able to write the bounds on the time complexity of an algorithm: you might really like this article!
