---
title: 'Asymptotic Notation'
description: 'Learn the basics of measuring the time and space complexity of algorithms'
authorId: 'kamran'
seo:
  title: 'Asymptotic Notation - roadmap.sh'
  description: 'Learn the basics of measuring the time and space complexity of algorithms'
isNew: false
type: 'visual'
date: 2021-04-03
sitemap:
  priority: 0.7
  changefreq: 'weekly'
tags:
  - 'guide'
  - 'visual-guide'
  - 'guide-sitemap'
---

Asymptotic notation is the standard way of measuring the time and space that an algorithm will consume as the input grows. In one of my last guides, I covered "Big-O notation" and a lot of you asked for a similar one for Asymptotic notation. You can find the [previous guide here](/guides/big-o-notation).

[![Asymptotic Notation](/guides/asymptotic-notation.png)](/guides/asymptotic-notation.png)