---
title: "Discussion on \"How To Find Time Complexity of an Algorithm?\" | Hashnode"
description: "Discussion on \"How To Find Time Complexity of an Algorithm?\". First question is, what is time complexity?\nWe can say Time Complexity as the time an algorithm will take to execute. Here, we find Best Case, Average Case, Worst Case scenario. We denote the above scenario as\nBest Case: OmegaAverage Case: ThetaWorst..."
url: "https://hashnode.com/posts/how-to-find-time-complexity-of-an-algorithm/68171b093332116d366c562b"
---

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

Discussion

# [How To Find Time Complexity of an Algorithm?](https://codegyan.hashnode.dev/how-to-find-time-complexity-of-an-algorithm?utm_source=hashnode&utm_medium=feed)

First question is, what is time complexity? We can say Time Complexity as the time an algorithm will take to execute. Here, we find Best Case, Average Case, Worst Case scenario. We denote the above scenario as Best Case: OmegaAverage Case: ThetaWorst...

May 4, 2025 · 2 min read · codegyan.hashnode.dev  
Read the article

-   [#chaicode](https://hashnode.com/tag/chaicode)
-   [#dsa](https://hashnode.com/tag/dsa)

## Written by

[Abhinav Kumar](https://hashnode.com/@ashtavakra)

@ashtavakra

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

OnlyCodeGyan

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
