1. Algorithm Design
An algorithm is a finite set of rules giving a sequence of operations for solving a particular problem or stating, if necessary, that there is no solution.
This page has been specially prepared for my beloved students.
There are many approaches to algorithm development, two of which are:-
- * Flowcharts
- * Pseudocode (or structured English)
It is the use of English or English-like statements to represent a program or a systems design.
I will now illustrate the development of algorithms through examples. But before doing so let us see what has to be done after the algorithms have been developed.
1.1 Dry Run
It is the use of test data to check the paths through a program, or system, design (i.e. the algorithm) without the use of a computer.
To perform a dry run we make us of a trace table.
Trace Table: – It is a tabular method of recording the values expected to be taken by variables as test data is processed by a program. These values are then compared against the actual results.