Expression evaluation is a crucial part of algorithms. First, an expression consists of one or more identifiers or literals separated by an operator. We say that the value of the literal 5 is itself. An arithmetic expression is an expression that evaluates to a numeric value. A Boolean expression is an expression that evaluates to be true or false.
TRUE is a constant that denotes true.
It is important to understand that the variable, n1, isn't printed out, but its value. Finally, we use the keyword endalgorithm to mark the end of the algorithm, and we follow it with the name of the algorithm as a comment. In this algorithm, we have encountered many of the important statements and control structures in programming. We can characterize an algorithm as consisting of either elementary or composite components. The elementary components are the statements for reading, printing, assigning, and doing arithmetic or logical expression evaluation.