Introduction to Data Structures and Algorithm — Asymptotic Analysis and the Big O Notation.

Unraveling Data Structures and Algorithms (Part 3): Asymptotic Analysis and the Big O Notation.

Here is what you need to know to get started in Data structures and Algorithms.

Learning Objectives.

Understanding the Growth Rate of Functions.

Exploring the Concept of Big O Notation.

This article is the third in a series that introduces Data Structures and Algorithms. You can find the previous articles here.

1. Introduction to Data Structures and Algorithms
2. Introduction to Data Structures and Algorithms (Part 2) — Algorithms and Complexity Analysis.

Introduction

In the previous chapter, we looked at complexity analysis and how we can analyze an algorithm by counting the number of operations. Now that you’ve learned how we analyze running time. Let us extend that understanding a bit further. We will touch on some key crucial terms like asymptotic analysis and growth rate. This will ensure that you fully grasp the concept of Big O Notation