A. The first location
What is the output of the algorithm?
of the smallest element in the list of integers
procedure tt (a1, a2, ., an: integers)
d := a1
for i:=1 to n do if da; then d := a;k := n while (k >= 1) and (ak > d)k: k-1 Print (k)
B None of the other choices IS
correct
3
C. The smallest element in the list of integers
D. The last location of the smallest element in the list of
<
