# The Big O

## Too Long; Didn't Read

Big O Asymptotic Analysis Notation is a way to measure how well your code solves a problem. Big O is a universal language we use as engineers to determine how long an algorithm takes to run. Performance of this function, or algorithm, is determined differently by each computers CPU and they have different varying factors such as other programs running that may slow down the program. The Big O solves this issue by being the universal language. As our input consistently grows, it tells us how long our algorithm takes. This is irrespective of computer differences and can be described in the following graph.