Data Structures & Algorithms: Asymptotic Analysis & Notations

In this article, the importance of asymptotic analysis is explained, followed by the introduction to asymptotic notations. The worst, average, and best case time complexity analysis are also briefly discussed.

Why asymptotic analysis?

Let’s assume we have two most popular sorting algorithms implemented -

1. Insertion Sort, which roughly takes a*n² time.
2. Merge Sort, takes b*n log n time.