Java algorithm flowchart

I. What is an algorithm: specific methods and steps to solve the problem

Two. Basic features of the algorithm

1. Poor: An algorithm must terminate after performing a limited number of operation steps.

2. Certainty: The meaning of each step in the algorithm must be exact and no ambiguity can occur.

3. Validity: Each step in the algorithm should be executed effectively, and an unenforceable operation is not valid. For example, a number that is removed by 0 is invalid and should be avoided.

4. There are 0 or more inputs: the input here refers to the initial data required before the algorithm starts. How much of these inputs depends on the specific problem.

5. There is one or more outputs: the so-called output refers to the amount of a particular relationship with the input, at least one output in a complete algorithm. For example, to calculate from 1 to 100, if the program has no output, then it will become meaningless.

Three. Flowchart

including start and End boxes, processing boxes, input and output boxes, process lines, judging boxes, connection points

1. Sequential structure

2. Select structure

3. Cyclic structure

Java algorithm flowchart