Big O, how do you calculate/approximate it?
Posted
by Sven
on Stack Overflow
See other posts from Stack Overflow
or by Sven
Published on 2008-08-06T10:18:16Z
Indexed on
2010/04/27
20:53 UTC
Read the original article
Hit count: 348
Most people with a degree in CS will certainly know what Big O stands for. It helps us to measure how (in)efficient an algorithm really is and if you know in what category the problem you are trying to solve lays in you can figure out if it is still possible to squeeze out that little extra performance.*
But I'm curious, how do you calculate or approximate the complexity of your algorithms?
*: but as they say, don't overdo it, premature optimization is the root of all evil, and optimization without a justified cause should deserve that name as well.
© Stack Overflow or respective owner