Big O Notation
Update 2024-09-05: I have updated this post to contain some coding examples as a way to better describe differing complexities.
What is Big O Notation? A mathematical notation we use to describe the time complexity or space complexity of an algorithm. It provides a way to analyse and compare the efficiency of different algorithms by looking at how their performance scales with the input size.
In short, it’s a reasonably straightforward way to analyse the efficiencies of algorithms, based purely on instruction sets.
