For those who have a degree in computer science, you’ll immediately recognize Big-O notation.  My data structures class required students to figure out the Big-O for best and worst case situations for sort algorithms.  Today, I stumbled across a Big-O cheat sheet web page that is rather interesting:

Know Thy Complexities!

This is handy for students or developers that are about to use an algorithm and want to check how it should perform depending on the data set they are working on.

Each link takes you to a wiki page on the algorithm in question so you can get details without searching around the web. 

My purpose in posting this on my blog is to make people aware of the existence of this handy website and so I can find it again in the future if I need it myself.


Leave a Reply