Algorithmic Complexity was founded in 2014 to help people prepare for challenging technical interviews, study for exams, and improve their skills in the domain of computer science.

We seek to provide easy to understand explanations, examples, and a quick reference to any question you may have relating to algorithms, data structures, and asymptotic growth.

Frustrated by the lack of concise, easy-to-understand, explanations of algorithms and data structures, we at Algorithmic Complexity aim to provide simple explanations to a variety of the most commonly encountered algorithms and data structures. For your studying convenience we have assembled a cheat sheet of big-o notation complexities that you are free to download and distribute. All that we ask is you leave the URL of this website on the cheat sheet.

If you find the content on this site useful please consider making a small donation  to help us continue to improve the site and cover our expenses.  No donation is too small. 10% of all proceeds will go on to support the Wounded Warrior Project or the Lone Survivor Foundation.