A recipe calls for for half-cup of sugar. Unfortunately Kirk only has a teaspoon with which to measure. he knows that there are
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
Answer: A
Step-by-step explanation:
3x² - 10x + 5 = 0
a = 3 b = -10 c = 5
Δ = b²- 4ac = 100 - 4.3.5 = 40 > 0 => have 2 solutions
=> x = or x =