---
title: "Discussion on \"What Is Big O?\" | Hashnode"
description: "Discussion on \"What Is Big O?\". What is big O?\nWhat's up, everyone!? 🤙\nToday we’ll dive deeper into time complexity and the big O notation. There are a number of factors that have an impact on the time complexity, in other words how fast our application would be.\nThere is one impo..."
url: "https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724"
---

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

Discussion

# [What Is Big O?](https://blog.codingbrah.com/what-is-big-o?utm_source=hashnode&utm_medium=feed)

What is big O? What's up, everyone!? 🤙 Today we’ll dive deeper into time complexity and the big O notation. There are a number of factors that have an impact on the time complexity, in other words how fast our application would be. There is one impo...

Aug 28, 2020 · 6 min read · blog.codingbrah.com  
Read the article

-   [#2articles1week](https://hashnode.com/tag/2articles1week)
-   [#javascript](https://hashnode.com/tag/javascript)
-   [#nodejs](https://hashnode.com/tag/nodejs)
-   [#reactjs](https://hashnode.com/tag/reactjs)
-   [#100daysofcode](https://hashnode.com/tag/100daysofcode)

## Written by

[Codingbrah](https://hashnode.com/@codingbrah)

@codingbrah · Poznań, Poland

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

Web/Mobile App Developers

What's up!? 🤙 We're two developers who love to share their knowledge! You will find here awesome stuff about programming and tech stuff. Feel free to contact us if you got any questions! Check out our website https://codingbrah.com

## Responses 2

Markdown supported · ⌘↵ to post

[Edidiong Asikpo (Didi)](https://hashnode.com/@didicodes)

[Aug 29, 2020](https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724/comment/5f4a4d49c3f717522b11ad2b)

Insightful article. Thank you!

[Mark](https://hashnode.com/@mverleg)

[Aug 28, 2020](https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724/comment/5f493a9c6686a44e34fcbd44)

Interesting description, useful topic for almost all developers :-)

> the number of operations is decreasing when the number of your inputs grow

Fewer operations when input grows, that would be a cool algorithm :-) That'd be `O(1/n)` or something though, not `O(log(n))`.

> What is big O?

Urban dictionary does not agree with this answer :-) Sorry, couldn't resist.

[Codingbrah](https://hashnode.com/@codingbrah)

[Aug 28, 2020](https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724/comment/5f493a9c6686a44e34fcbd44#reply-5f4966916686a44e34fcbe8c)

Hahaha, I didn't know about that definition of big O that you've mentioned! 😂 You made my day! 😃

Regarding the 0(log(n)) algorithm, I meant that the number of operations decreases by a fraction. That basically means, that when we're looping we cut our problem into smaller pieces (for example you split your problem in half). The number of operations doesn't decrease by the absolute value (I suppose that's how you understood that) 🧐 .
