Introduction

Algorithms

A planning process must precede implementing a computer program.
The computer needs a systematic approach for finding solutions: a series of steps that involves no guesswork.
An algorithm is a solution technique that is unambiguous, executable, and terminating.
- Unambiguous - no room for guesswork or creativity.
- Executable - each step can be carried out in practice.
- Terminating - the process will eventually come to an end.