Algorithms, analysis of

  • Authors:
  • John E. Hopcroft;Daniela Rus

  • Affiliations:
  • -;-

  • Venue:
  • Encyclopedia of Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The analysis of algorithms can be partitioned into two areas: algorithm complexity and problem complexity. The former is concerned with consideration of a specific algorithm for a problem and the analysis of its behavior with respect to the amount of memory space, time, or other resource used. The latter is concerned with the class of all algorithms for a particular problem and the determination of its minimum requirements with respect to space and time or other resources. Such analyses are second in importance only to the determination of the correctness of an algorithm. They provide the means to choose algorithms intelligently and improve them.