# Algorithms

Characteristics of Pseudocode
• Named variables represent data and identifiers denote higher level functions.
• Composed of a sequence of statements or steps.
• Statements are often numbered sequentially.
• Operational (Imperative) statements include assignment, input, and output.
• Control structures provide iterative and conditional execution. [1]
• Indentations used for grouping blocks of statements.
There is no fixed syntax. Clarity of expression, rather than rigidity, is the essence of pseudocode.

Footnotes:

1. In fact programming systems (and thus algorithms) contain five styles of control: sequencing, condition, iterative, recursive, and abstraction (also known as procedure call). See Lee's law for other examples.
2. A variable is a type of object (both is mathematics and programming languages) that can be associated with different values, though in mathematics the value is fixed for the duration of a particular consideration.
3. An identifier is a means of "identifying" on object; commonly identifiers are names given to an object. The term "names" commonly infers alphabetic strings. On the other hand, the identifier of a numeric value for example is a numeric string -- such as 3.1415926. "A+B" is the identifer of a particular expression.

CS1104 Main Page
Last Updated 02/15/2000