Algorithmic Thinking

• Five basic properties of algorithms

  • Input Specified … like procedure formals
  • Output Specified … like procedure results
  • Effectiveness
  • Definiteness
  • Finiteness … iterations stop

• Alphabetize CD’s example

• Importance of language in being

precise

• Difference between algorithms and

programs

Algorithms ...

Assured by language

Previous slide

Next slide

Back to first slide

View graphic version