News for hackers. Stuff that matters.
Re:Application for Fixed Satellite Service by SpaceX by rak00n on Thursday November 08, 2018 @08:52PM (#18411810)
I have seen it getting used in many places and it's understood as order of. O(n) means at worst case number of steps needed to complete an algorithm would be c.n + a. So it is completely valid use since O(1000) would mean it can be c.1000 + a, which actually means order of 1000s.
Re:Application for Fixed Satellite Service by SpaceX by loeg on Thursday November 08, 2018 @08:57PM (#18411825)
This is also an inaccurate description of the property O().
Re:Application for Fixed Satellite Service by SpaceX by rak00n on Thursday November 08, 2018 @09:18PM (#18411903)
Re:Application for Fixed Satellite Service by SpaceX by loeg on Thursday November 08, 2018 @09:59PM (#18412041)
https://en.wikipedia.org/wiki/Big_O_notation

> Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.

I.e., it's an asymptotic upper bound.

It's also interesting to compare with Ω() (Big Omega ­— asymptotic lower bound) and Θ() (Big Theta) (big-O AND big-Omega): https://en.wikipedia.org/wiki/Big_O_notation#Family_of_Bachm...

A good textbook on this subject is Introduction to Algorithms: https://www.amazon.com/dp/0262033844/ .

Re:Application for Fixed Satellite Service by SpaceX by rak00n on Friday November 09, 2018 @01:03PM (#18416420)
What I described is the same thing in layman's term. Worst case is the colloquial word for upper bound. And in that example n was approaching 1000.

If you want to be puritan the only fault I see in my definition is instead of using a generic function I assumed it's linear function - but that's for explaining the colloquial use.

Re:Application for Fixed Satellite Service by SpaceX by repsilat on Thursday November 08, 2018 @10:00PM (#18412045)
It's just an asymptotic upper bound (though often used to imply tight bounds).

It's most commonly applied to worst case running time, but is often applied to expected running time ("hash table insertions run in O(1)"), space complexity, communication overhead, numerical accuracy and any number of other metrics.

Re:Application for Fixed Satellite Service by SpaceX by loeg on Thursday November 08, 2018 @10:05PM (#18412062)
Yep. Often people mean the narrower big-theta when they express complexity in terms of big-O.