The Startup
Published in

The Startup

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.




Get smarter at building your thing. Follow to join The Startup’s +8 million monthly readers & +756K followers.

Recommended from Medium

A* Algorithm in droplets — Pt.1

How To Use Math To Get In Shape At Any Age

First step of physic by 4 parameters

I Know Less about Algorithms than I’d Like

How to Crack a Cheating Scandal with 1 Line of Code

Not All Infinite Sets Are the Same Size

Magnetic mapping and navigation

How to Find the Probability of an Event and Calculate Odds, Permutations, and Combinations

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
Diptanu Sarkar

Diptanu Sarkar

Novice writer, experienced programmer.

More from Medium

Let’s talk about Linked Lists · Data Structures #Part 1/3

Box Stack Problem — Recursive way

Set Matrix Zeroes ( Leetcode 73 )

Solving Array problems in O(n) time and O(1) space