| | | | | |

Issues of Proof

  • Correctness
    • Are we certain that the algorithm terminates?
    • Are we certain the algorithm delivers its outcomes?
    • Need support methodology for proving that algorithms do what they claim to do.
  • Performance
    • How fast are the algorithms?
    • How much memory do they require for operation?
    • Need some basis for comparing speed of algorithms --
      general enough to apply to other resources, such as memory use and I/O dependence

| | Top of Page | 3. Introduction to Algorithm Analysis - 10 of 23