m_turner says in the preceding node:
"big-O: O(...)
The theoretical upper limit of execution time (complexity)
of an algorithm given the problem size n."
yada yada yada
"To go from a data set of 1 to 1,000 results in 299 times
more operations, or about 10300. Also avoid O(N!) algorithms."
Oh you crazy techies!!
The "Big O" is an orgasm.
Perhaps a term more commonly used by females, who
perhaps are more inclined to euphemisms....
Perhaps.