3.1.1.1.1 Pseudocode Conventions

The following pseudocode conventions are used when defining algorithms.

Syntax

Semantics

x := y

Assign y to x

x = y

Compare x and y for equality

x <> y

Compare x and y for inequality

x << y

Left-shift x by y bits

x >> y

Right-shift x by y bits

x & y

Perform the logical-AND operation on x and y

x[y]

Access the element at index y in array x. All array indices are zero-based

x.y

Access the member named y of data structure x

All algorithms assume a little-endian computer architecture.

Show: