This graph shows the amount of charge left on my
1 answer:
You might be interested in
Answer:
min = a_1
for i:= 2 to n:
if < min then min =
return min
Step-by-step explanation:
We call the algorithm "minimum" and a list of natural numbers
So lets first set the minimum to
min = a_1
now we want to check all the other numbers.
We can use a simple for loop, to find the minimum
min = a_1
for i:= 2 to n:
if < min then min =
return min