Shows Big-O time and space complexities of common algorithms used in .NET and Computer Science. You can see which collection type or sorting algorithm to use at a glance to write the most efficient code. This is also useful for those studying Computer Science in University or for technical interview tests where Big-O notation questions can be fairly common depending on the type of company you are apply to.
All credit goes to the creator of the Big-O Algorithm Complexity Cheat Sheet Eric Rowell and the many contributors to it. You can find the original here. I simply added .NET specific bits to it.
