---
title: "Comment by Mark on \"What Is Big O?\" | Hashnode"
description: "Interesting description, useful topic for almost all developers :-) the number of operations is decreasing when the number of your inputs grow Fewer operations"
url: "https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724/comment/5f493a9c6686a44e34fcbd44"
---

[Discussion](https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724)

Comment [What Is Big O?](https://hashnode.com/posts/what-is-big-o/5f492bd4e8bad44a54232724)

[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) 🧐 .
