5 ms·
It depends what you mean. If you mean using asymptotic analysis on a "new" algorithm to figure out its running time (master theorem, recurrence relations, etc.)
by baddox 15y ago
It depends what you mean. If you mean using asymptotic analysis on a "new" algorithm to figure out its running time (master theorem, recurrence relations, etc.), then probably never.
If you mean using your knowledge of computational complexity to inform your choice of algorithms and data structures, then all the freaking time.