Solution (in English):
- Find out what the new landing time will be and store it in a variable called “newLandingTime.”
- Find out the available landing times and store them in a variable called “availableTimes.”
- Compare newLandingTime to each of the availableTimes.
- If availableTimes is greater than or equal to newLandingTime, land in Courtenay.
- If availableTimes is less than newLandingTime, eliminate the time and check the next one.
- If there are no availableTimes left, land in Smits Field.
Solution (flowchart):
Leave a Reply