Peer-graded Assignment: Finding Minimum Values

In this assignment, you will convert a plain-English description of an algorithm to a flowchart, using some of the concepts from the “find-max” algorithm.
In completing this assignment, you will:
Modify an existing algorithm in order to solve a slightly different problem
Create a flowchart to describe an algorithm
Step-By-Step Assignment Instructions
In the first lesson of this part of the course, we learned about a simple algorithm to find the largest value in a collection and saw its flowchart.
Now, draw the flowchart for an algorithm (described below) that will find the two smallest values in the collection. You can assume that the collection has at least two values and that all values are distinct.
The algorithm works by making one pass through the collection and keeping track of the two smallest values seen so far:
1. Initialize the two smallest values so far to be the first two elements of the list
2. For each remaining value in the list: if the value is smaller than either of the two smallest so far, replace the larger of the two
There are a few ways to represent the two smallest values seen so far, but for this assignment, please use the following approach:
Set “min1” to the first value of the collection and “min2” to the second
Next, look at each remaining element in the collection:
If the element is less than “min1” and “min1” is less than “min2”,
Then set “min2” to that element’s value
Otherwise, if the element is less than “min1” but “min1” is greater than “min2”,
Then set “min1” to that element’s value
Otherwise, if the element is greater than “min1” and is less than “min2”,
Then set “min2” to that element’s value
After inspecting all elements, output “min1” and “min2,” which hold the two smallest values
Using the flowchart notation from the previous part of the course, and based on the basic operations of iterating over elements of a collection, comparing values, and updating variables that we saw in the flowchart for the find-max and find-min algorithms, draw a flowchart for the algorithm you have created. You can draw the flowchart using a tool like draw.io or PowerPoint, or simply do it by hand and take a photo of your work. Create a PDF of your flowchart and upload that as your submission.
Helpful Hints
1. First, review the flowcharts for the “find-max” and “find-min” algorithms and be sure you understand the decisions that are being made, how values are being updated, and how the algorithm continues iterating over all elements of the list; you will need to use all of those concepts for the flowchart you create here.
2. Then, before attempting to draw the flowchart, be sure you understand the algorithm that is described above. Come up with some simple inputs and step through the algorithm, updating “min1” and “min2” as you go along, to convince yourself that it works.