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.

Where a and b are constants, and n is the input size. Intuitively we know, n² > n*log n, for any input size n > 0.

Now consider a situation: The insertion sort is implemented in one of the fastest programming languages say C++, and…

Diptanu Sarkar

Novice writer, experienced programmer.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store