Relevance::Analysis of algorithms


Growth::run-time    Which::analysis    Computer::constant    Right::computer    ''n''::running    First::given

Relevance Algorithm analysis is important in practice because the accidental or unintentional use of an inefficient algorithm can significantly impact system performance. In time-sensitive applications, an algorithm taking too long to run can render its results outdated or useless. An inefficient algorithm can also end up requiring an uneconomical amount of computing power or storage in order to run, again rendering it practically useless.

Analysis of algorithms sections
Intro   Cost models   Run-time analysis  Relevance  Constant factors  See also  Notes  References  

PREVIOUS: Run-time analysisNEXT: Constant factors