Home
Feed

Extend

Hashnode Pro
Hashnode for Agents

Resources

The foreword
Hashnode gql skill

Buildful - AI coding agent that delivers frontier-level results at a fraction of the cost Bug0 - The AI-native e2e QA regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Search Hashnode

Search posts, tags, users, and pages

Discussion on "What Is Big O?" | Hashnode

Feed/

Discussion

Codingbrah

Web/Mobile App Developers

Aug 28, 2020

What Is Big O?

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...

blog.codingbrah.com6 min read

#2articles1week #javascript #nodejs #reactjs #100daysofcode

Responses2

Markdown supported · ⌘↵ to post

Edidiong Asikpo (Didi)

Senior Developer Advocate at Ambassador Labs

Aug 29, 2020

Insightful article. Thank you!

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.

Mark

Aug 28, 2020

Codingbrah

Web/Mobile App Developers

Aug 28, 2020

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