Group items tagged

Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm. [..] Hopefully this article will help you gain an understanding of the basics of Big O and Logarithms.

"A look at the core data structures and algorithms used in day-to-day applications."

"All code can be classified into two distinct roles; code that does work (algorithms) and code that coordinates work (coordinators)."