Describe an algorithm for finding both the largest and the smallest integers in a finite sequence of integers.

Question

Accepted Answer

Algorithm that produces the minimum(smallest) and maximum(largest) integers in a finite sequence of integers $x_{1}, x_{2}, x_{3}$ is:

procedure min and max ( $x_{1}, x_{2}, x_{3}$ : integers with $n \geq 1$ ).

role="math" localid="1668421689261" $m i n : = x_{1} m a x : = x_{1}$

for $i : = 2$ to n

If $x_{i} < m i n$ then $m i n : = x_{i}$ .

for $i : = 2$ to n

If $x_{i} > m a x$ then $m a x : = x_{i}$ .

return min, max

Short Answer