Use the blocks on the right and place them in order in a list on the left to describe an algorithm that takes as input a list of n integers and produces as output the largest difference obtained by subtracting an integer in the list from the one following it.
if m procedure difference(a1, a2, an: integers)
for i=2 to n
max = a1-a2
max = a2-a1
m = a(i-1) - ai
for i=2 to n-1
m = ai a(i+1)
if m> max then max = m

answer: get more recipes with 3 magazines for $20! i often use chicken broth instead of water. 3 tablespoons butter, divided; 1/2 cup freshly grated parmigiano-reggiano bring water and salt to a boil in a large saucepan; pour polenta slowly into 5 minutes to thicken; stir and taste for salt before transferring to a serving bowl.

y=x+9

?

step-by-step explanation:

you can't solve x because it is 2 linear equation and you only have one equation