In the algorithm flow, the symbol of judgment is

The graphic symbol used for judgment in the algorithm flow chart is a diamond box.

Design algorithm is the core of program design. To represent an algorithm, different methods can be used. Commonly used are natural language, flow chart, pseudo code, PAD diagram, etc. Among them, the chart representing the algorithm with specific graphic symbols and explanations is called the algorithm flow chart. Algorithm flow chart includes traditional flow chart and structured flow chart.

Computer language is just a tool. The rules of language learning are not enough. The most important thing is to learn to work out effective solutions and steps for various problems, that is, algorithms. With the correct and effective algorithm, you can write programs in any advanced computer language to make the computer work. Therefore, the design algorithm is the core of program design.

To represent an algorithm, different methods can be used. Commonly used are natural language, flow chart, pseudo code, PAD diagram, etc. Among them, the chart representing the algorithm with specific graphic symbols and explanations is called the algorithm flow chart.

Basic structure:

The traditional flow chart uses streamline to represent the execution order of each box, and there is no strict restriction on the use of streamline. Therefore, users can turn the flow direction freely without restriction, which makes the flow chart irregular, and readers have to spend a lot of energy tracking the flow direction, making it difficult to understand the logic of the algorithm.

If the algorithm we write can limit the irregular and arbitrary turning of the process, and it is composed of chapters and sections in order like a book, it will be very convenient to read without any difficulty, as long as it is read from beginning to end in order.

In order to improve the quality of the algorithm and make it easy to design and read, it is necessary to limit the abuse of arrows, that is, it is not allowed to make the process rotate irregularly, but only in order. But the algorithm will inevitably contain some branches and loops, and it is impossible to make them all box by box.