Understanding Big-O and why it is useful

Big-O notation gives us an approximation of how fast an algorithm runs. I use “approximation” because Big-O does not necessarily give us the exact runtime, but rather the number of times a statement executes. If you run the same function, but on different machines, the runtimes will almost always be…

Brandon Galloway

Web developer with a passion for science at technology.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store