Work in progress: 181,232 of 181,233 sites checked so far, more every week · updated 2 Nov 2026Missing a blog? Tell us

Top all-time · #7710

R

Rob Bell

Personal blog · rob-bell.netprogrammingcareer

Rob Bell's personal blog at rob-bell.net covers programming and career. Since 2009, 10 different Hacker News readers have linked it 10 times, most often “A Beginners’ Guide to Big O Notation”. No feed was found, so read it on the site itself.

No feed foundVisit the blog
10mentions?
10HN people?
2009–2018first – last linked?
Links on Hacker News per year · peak 3 in 2016

Too few sampled comments (3) to say how often HN recommends it.?

Why HN links it

Linked as a reference for Big O notation and how loop and algorithm growth rates scale. Commenters cite it to explain the concept rather than to praise the writing.

Summarised by Claude from a sample of 3 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.

Thoughts on software engineering from Rob Bell

Most-linked posts?

  1. A Beginners’ Guide to Big O Notation
    5 people · 5 mentions · first linked 2009-06-26
  2. A beginner's guide to Big O notation (2009)
    4 people · 4 mentions · first linked 2016-05-05

What Hacker News says?

  1. known as "Big O Notation": https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-nota...

    Comment linking /2009/06/a-beginners-guide-to-big-o-notation/

    on “On Starting a Software Business”
  2. Submitted A beginner's guide to Big O notation (2009) as a story · 312 points

    HN discussion
  3. Ironically, big-O describes things that are very easy to understand, in a notation that looks complicated. If you have a lot of experience, you probably already understand the concepts. The notation just gives a clear way to describe them: https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-nota... ,

    Comment linking /2009/06/a-beginners-guide-to-big-o-notation/

    on “The Imposter's Handbook”
  4. Submitted A Beginners’ Guide to Big O Notation as a story · 37 points

    HN discussion
  5. It's not a dumb question, this idea is covered at the beginning of every data structures class and is described as Big O Notation. The difference is the growth rate. for(..){} for(..){} will grow linearly, or O(n). Iterating over 10 items will be 20 loops, while iterating over 11 items will only be 22 loops. for(..){ for(..){ } } grows exponentially, or O(n^2) Here iterating over 10 items will be 100 loops, and incr…

    Comment linking /2009/06/a-beginners-guide-to-big-o-notation/

    on “Is one double for loop better than two for loops?”
  6. Submitted A Beginner’s Guide to Big O Notation as a story · 5 points

    HN discussion
  7. Submitted Sleepless in south-east London: Surviving your first hackathon as a story · 2 points

    HN discussion
  8. Submitted A Beginner’s Guide to Big O Notation as a story · 2 points

    HN discussion
  9. Submitted A beginner's guide to Big O notation (2009) as a story · 1 points

    HN discussion
  10. Submitted A Beginners Guide to Big O Notation as a story · 1 points

    HN discussion

Search all of HN for rob-bell.net