A beginner’s guide to Big O notation

In Computer Science we use Big O notation to describe the efficiency or complexity of an algorithm. The Big O specifically describes worst-case scenario, and it can also be used to describe the execution time and the space the code takes to run.
This article only covers the very basics or Big O and logarithms. For a more in-depth explanation take a look at their respective Wikipedia entries: Big O Notation, Logarithms.

Related posts

The Future of Mobile Security: Emerging Threats and Countermeasures

From Concept to Launch: Ensuring Cybersecurity in Product Development

What Exactly is Telematics? The Technology That’s Changing How We Drive