(OTOH the sheer fact that you have to wait too long already gives you information that the tested algorithm might not be what you wanted).
But you're right, worst case complexity is far less practicable, because this implies checking _all_ cases. And worst case is what you normally want to be expressed by the Landau symbol.
Cheers Rolf
In reply to Re^4: Algorithm complexity
by LanX
in thread Algorithm complexity
by fauria
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |