News for hackers. Stuff that matters.
Re:A beginner's guide to Big O notation (2009) by Jtsummers on Thursday May 05, 2016 @12:10PM (#11637311)
> Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.

From higher up in the article. You picked the O(N) section description to pick a nit with the whole article when it covers exactly what you want it to earlier.

Re:A beginner's guide to Big O notation (2009) by nemetroid on Thursday May 05, 2016 @12:18PM (#11637414)
That's not what the grandparent is getting at. Big O describes an upper bound (and often, but not necessarily, refers to the worst-case scenario).