Big-O Complexity cool cheat sheet

Recently I signed up for Algorithms: Design and Analysis course. Most of the time Test Automation doesn't require to know which algorithm sorts best, but I still believe that knowing that a good programmer is not the one who knows a lot of languages, but the one knows algorithms well and which one to apply where.
One of the tricky parts for me was to understand the "complexity" of each algorithm. Usually, it's stated as O(n), O(1) etc, which wasn't really clear for me. But now it all became easy thanks to Complexity Cheat Sheet . This page is all about algorithms complexity given in very clear and understandable form. Check it out :