---
title: "Discussion on \"Time Complexity\" | Hashnode"
description: "Discussion on \"Time Complexity\". How to describe runtime of an algorithm?\nThere are 3 notations used to describe time complexity.\nBig O time is an asymptotic notation used to describe the efficiency of algorithms.\n\nIt describes an upper bound on time.\n\nBig omega\n\nIt is asymptotic lo..."
url: "https://hashnode.com/posts/time-complexity/66e85b4712990df96503f3e8"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Time Complexity](https://shubhambarve.hashnode.dev/time-complexity?utm_source=hashnode&utm_medium=feed)

How to describe runtime of an algorithm? There are 3 notations used to describe time complexity. Big O time is an asymptotic notation used to describe the efficiency of algorithms. It describes an upper bound on time. Big omega It is asymptotic lo...

Sep 16, 2024 · 2 min read · shubhambarve.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#software-engineering](https://hashnode.com/tag/software-engineering)
-   [#software-development](https://hashnode.com/tag/software-development)

## Written by

[Shubham Barve](https://hashnode.com/@ShubhamBarve)

@ShubhamBarve

  
[View profile](https://hashnode.com/@ShubhamBarve)

Software Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
