The following two algorithms are designed to find the minimum value in a list of integers. Create a variable min, and set this to the first value in the list. Compare each
Algorithm subsequent value in the list against the value of min, and if it is smaller than
1: or equal to the current value, set min to this value. When the end of the list
is reached, display the value of min
Create a variable min , and set this to 0. Compare each value in the list
Algorithm
against the value of min, and if it is smaller than the current value, set min to
11:
this value. When the end of the list is reached, display the value of min.
Which of the following statements correctly demonstrates that the two algorithms are
NOT equivalent?
Neither algorithm will correctly display the minimum value of the list [0, 5, 6, 2]
Algorithm I will correctly display the minimum value of the list [4, 10, 6, 1],but Algorithm II
will not
Algorithm Il will correctly display the minimum value of the list (-4, 2, 3, 2) but Algorithm
will not
Both algorithms will correctly display the minimum value of the list [-1, 3, -4, 8]