Pseudocode

related topics
{math, number, function}
{language, word, form}
{theory, work, human}
{system, computer, user}
{work, book, publish}
{style, bgcolor, rowspan}

Pseudocode is a compact and informal high-level description of a computer programming algorithm that uses the structural conventions of a programming language, but is intended for human reading rather than machine reading. Pseudocode typically omits details that are not essential for human understanding of the algorithm, such as variable declarations, system-specific code and subroutines. The programming language is augmented with natural language descriptions of the details, where convenient, or with compact mathematical notation. The purpose of using pseudocode is that it is easier for humans to understand than conventional programming language code, and that it is a compact and environment-independent description of the key principles of an algorithm. It is commonly used in textbooks and scientific publications that are documenting various algorithms, and also in planning of computer program development, for sketching out the structure of the program before the actual coding takes place.

No standard for pseudocode syntax exists, as a program in pseudocode is not an executable program. Pseudocode resembles, but should not be confused with, skeleton programs including dummy code, which can be compiled without errors. Flowcharts can be thought of as a graphical alternative to pseudocode.

Contents

Application

Textbooks and scientific publications related to computer science and numerical computation often use pseudocode in description of algorithms, so that all programmers can understand them, even if they do not all know the same programming languages. In textbooks, there is usually an accompanying introduction explaining the particular conventions in use. The level of detail of such languages may in some cases approach that of formalized general-purpose languages — for example, Knuth's seminal textbook The Art of Computer Programming describes algorithms in a fully-specified assembly language for a non-existent microprocessor.

A programmer who needs to implement a specific algorithm, especially an unfamiliar one, will often start with a pseudocode description, and then "translate" that description into the target programming language and modify it to interact correctly with the rest of the program. Programmers may also start a project by sketching out the code in pseudocode on paper before writing it in its actual language, as a top-down structuring approach.

Full article ▸

related documents
Multiplication table
Caesar cipher
Cyclone (programming language)
Principal ideal domain
Möbius function
Infimum
Homomorphism
Commutator
Division ring
Banach algebra
Elementary function
Square-free integer
Semi-continuity
HMAC
Cofinality
Ternary numeral system
String searching algorithm
Elliptic function
Counting sort
Pre-Abelian category
Iterative method
Bounded set
Upper and lower bounds
Binary space partitioning
Fermat's little theorem
Conjugacy class
Tuple
Soundness
Lambert W function
Enriched category