Big(O) Notation Is About Scalability, Not Speed
When comparing algorithms based on execution time, computer scientists use Big(O) notation. Big(O) describes how an algorithm's running time grows as the size of the input grows.
When comparing algorithms based on execution time, computer scientists use Big(O) notation. Big(O) describes how an algorithm's running time grows as the size of the input grows.