**Methods of Algorithm Description**

This is an official BOS document from the old 3u Computing Studies course.

It is an excellent resource for algorithms in SDD. Here is an excerpt describing what it includes -

*The preliminary section consists of a description of the programming process and some definitions of an algorithm presented in the form of overhead transparency originals. In the following section are descriptions of the main features of two methods of algorithm description: pseudocode and flowcharts. Descriptions and specific examples of the programming structures of sequence, selection, repetition and subprograms (procedures or subroutines) are given.*

The most substantial section of the document contains sample problems and worked solutions that show the use of each of the methods of algorithm description. The solutions do not purport to describe the 'ultimate' solution, but rather one (or more) possible solutions to the problem.

The most substantial section of the document contains sample problems and worked solutions that show the use of each of the methods of algorithm description. The solutions do not purport to describe the 'ultimate' solution, but rather one (or more) possible solutions to the problem.

The document also includes standard algorithms for searching and sorting.

You can download it HERE.

**NOTE: This document does not cover FOR ... NEXT loops, arrays, or processing records from a sequential file. They**

*are*in the syllabus.