A binary search function is searching for a value that is stored in the middle element of an array. How many times will the func
1 answer:
You might be interested in
Answer:
See attachment for flowchart
Explanation:
Required
Flowchart to fine even from 1 to 50
The flowchart has been attached.
The rough algorithm (explanation) of the flowchart is as follows.
1. Start
2. Initialize num to 1
3. Check if num is less than or equal to 50
3.1 If yes
3.1.1 Check if num is even
3.1.1.1 If yes
3.1.1.2 Print num
3.1.3 Increase num by 1
3.2 If num is greater than 50
3.2.1 Stop
4. Goto 3
