__Why learn Asymptotic Analysis?__

By learning Asymptotic Analysis, we can compare different algorithms and see which algorithm has a slower growth rate, or put differently, which algorithm is faster for larger input sizes.

Say we have two algorithms. One of the algorithms is slower for smaller input sizes but faster for larger input sizes. The other algorithm is faster for smaller input sizes but slower for larger input sizes. In this case, we would choose the algorithm that does better for larger input sizes. Why? Because small input sizes take a small amount of time to run regardless of how slow the algorithm is because computers these days are fast. For larger and larger input sizes, the difference between the running times of different algorithms becomes bigger and bigger. This is when computers are going to run much faster (like days faster) for better algorithms.

__Previous Section__

__Next Section__

**Copyright © 2021 Code 4 Tomorrow. All rights reserved.**
The code in this course is licensed under the MIT License.
*If you would like to use content from any of our courses, you must obtain our explicit written permission and provide credit. Please contact **classes@code4tomorrow.org** for inquiries.*