The use of the English language to describe the steps of an algorithm in clear, unambiguous statements that can be read from start to finish. The use of keywords such as START, END, IF and UNTIL provides a syntax similar to that of a programming language to assist with identifying logical steps necessary to properly describe the algorithm.

An example of the use of structured language can be demonstrated using the following problem:

Description of the problem: Describing the decision a person makes about how to get to a destination based on the weather and the distance from their current location to their destination.

Structured English example:

START

IF it is raining outside THEN

Catch the bus

ELSE

IF it is less than 2km to the destination THEN

Walk

ELSE IF it is less than 10km to the destination THEN

Ride a bicycle

ELSE

Catch the bus

ENDIF

ENDIF

END The Structured English description can easily be translated into code using a programming language and accurately captures logical elements that must be followed to answer the question posed.