Simply stated, Big-O notation is a formal mechanism to describe the performance or complexity of an algorithm in relation to its inputs.
We have decided here at Algorithmic Complexity we will be launching an online store to purchase our Big-O cheat sheet, Big-O cheat sheet posters, various computer science themed t-shirts, and eventually study software for your use.
We hope to have the store launched within the next 3 months!
Thank you for sticking with us!
Graphs are such an integral part of the study of computer science, yet many people get confused about the vernacular associated with them. This is the first post in a series of posts about various data structures and algorithms.
Here are some common terms associated with graphs you should know:
Thank you everybody for being so patient with us as we continue to flush out the site. We hope to have most of the algorithms and data structures complete by the end of April 2016! If you can’t wait, please purchase our Big-O Complexity Cheat Sheet today! The cost of the sheet helps support this site and the volunteers who work on it. Again, if you cannot afford to purchase the cheat sheet, contact us and we will get it to you for absolutely free!
After many discussions with the stakeholders of this site, it has been decided that the blog will be expanded to include more articles about software development and computer science. We plan on covering multiple topics such as in-depth look at algorithms, algorithm research, new algorithms, data structures, high performance code, software engineer practices, software job interview tips, and design patterns.
2016 is looking to be a great year at Algorithmic Complexity!