<aside> 💡 The Big O Notation

</aside>

Simplify

Ignore the cost of primitive operations and use the Growth Order (abstract simplification).

Growth Order

The main idea is tell the code behavior when it faces a huge input. So, you don’t need to worry about the constants and minor values, because it’s not changing the execution order that much.

Asymptotic Efficiency

Big inputs so the only relevant aspect when analyzing the execution time is the Growth Order.

Simplifying Abstractions

• Get rid of multiplying constants and sums.
• Get rid of minor importance values.

The only value that matters is the one with the biggest exponents.

Why?

Mapping it to familiar functions, like “linear”, “quadratic” and “logarithmic”.

External factors, like the computer you are using, may make codes run faster or slower, so you have to have a standard way to compare algorithms.