my browser probably implements this to be O(shiznit(n)) for a large enough n
Love this. Definitely my feeling when talking about Big O performance bounds. Folks rely a little too much on it as a method of determining performance, instead of actually running tests.
Most discussions in my everyday life about code/algorithms/datastructures tend to favor Big-O arguments over actual running cost in real world scenarios. Which can lead to tricky and embarrassing situations.
Love this. Definitely my feeling when talking about Big O performance bounds. Folks rely a little too much on it as a method of determining performance, instead of actually running tests.
Author here,
thanks i feel the same :)
Most discussions in my everyday life about code/algorithms/datastructures tend to favor Big-O arguments over actual running cost in real world scenarios. Which can lead to tricky and embarrassing situations.