News for hackers. Stuff that matters.
Re:Big-O notation explained by a self-taught programmer by algorias on Saturday July 27, 2013 @04:20AM (#6112215)
> Also could be because in practice algorithms with wildly varying constant factors out in front are rarely seen?

The main reason is that you want a result that does not depend on small implementation details, i.e. is consistent across programing languages and CPU architectures.

Things as simple as larger cache size or a slightly better hashing function in a dict can increase the running speed of a program by a constant factor.

There are no comments on this comment yet.