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
Answer:
$5
Step-by-step explanation:
medium popcorn- 2x
total - $23
large- 2x+3
23=4x+3
20=4x
x=5
The dividing line will have to hit the points (0,2) and (3,0)
then you can test the point (0,0) which satisfies the inequality, so you will shade the side that has (0,0) on it, so it's the first picture.
Answer:
-16
Step-by-step explanation:
14=6+z/-2
14-6=z/-2
8=z/-2
z=8*-2
z=-16
