---
title: "Discussion on \"Big-O Notation\" | Hashnode"
description: "Discussion on \"Big-O Notation\". Big O is conceptual. It expresses how quickly an algorithm's runtime grows relative to the input.\nBig O represents the worst-case, always. Even if you think what you're looking for is the very first thing in the set, Big O doesn't care ,a loop-based ..."
url: "https://hashnode.com/posts/big-o-notation/62a1b794a4c962768fc3472a"
---

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

Discussion

# [Big-O Notation](https://ashoksubbiah.in/big-o-notation?utm_source=hashnode&utm_medium=feed)

Big O is conceptual. It expresses how quickly an algorithm's runtime grows relative to the input. Big O represents the worst-case, always. Even if you think what you're looking for is the very first thing in the set, Big O doesn't care ,a loop-based ...

Jan 3, 2020 · 1 min read · ashoksubbiah.in  
Updated Jun 28, 2022  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[Ashok](https://hashnode.com/@AshokSubbiah)

@AshokSubbiah

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
