element in the list of integers
What is the output of the algorithm?
procedure tt (a1, a2, ., an: integers)
B.None of the other choices IS correct
C. The smallest element in the list of 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)
3
D. The last location of the smallest element in the list of integers
<
