Wednesday, March 24, 2010

Big O and the Real World

I wonder if for every algorithm a [professional (working somewhere respectable and getting paid( for whatever that is worth))] computer programmer writes- do they test it across multiple computers to find various running times, compare their algorithms to other similar algorithms and find the running times of those algorithms and then finally, write big O proofs to precisely determine if their algorithm is faster than those other similar algorithms?

That seems to be a lot of work no? And if the algorithm is slower- how frustrating!

No comments:

Post a Comment