statement should be found to be then the logical execution of the algorithm true, will the left-hand side of the page. flow down In the above depicted example, if the condition tested by the: statement should be found to be then the logical execution of the false, algorithm will the right-hand side of the page. flow down When we introduce a logical split into our algorithm, then this is termed: ‘branching’ . The true and false tributaries of the depicted flow-chart algorithm are termed: ‘branches’ . Figure 2: The algorithm We can instruct the computer to do branches. different tasks depending upon whether the logical condition tested by the if statement be found true or false. Figure 3: In this segment of a Flowchart Algorithm, we can see that it after we test a logical condition with an In the branches if statement.
statement should be found to be true, then the logical execution of the algorithm will flow down the left-hand side of the page. In the above depicted example, if the condition tested by the: statement should be found to be false, then the logical execution of the algorithm will flow down the right-hand side of the page. When we introduce a logical split into our algorithm, then this is termed: ‘branching’ . The true and false tributaries of the depicted flow-chart algorithm are termed: ‘branches’ . Figure 2: The algorithm branches. We can instruct the computer to do different tasks depending upon whether the logical condition tested by the if statement be found true or false. Figure 3: In this segment of a Flowchart Algorithm, we can see that it branches after we test a logical condition with an if statement. In the
flow_control_statement.docx