Click and drag statements to make a recursive algorithm for finding the maximum

Question

Click and drag statements to make a recursive algorithm for finding the maximum of a finite set of integers, making use of the fact that the maximum of n integers is the larger of the last integer in the list and the maximum of the first n-1 integers in the list. mmax(01,02,.an-1 procedure mar(al,a2 , ani ?ntegers) else if n 1 then return an else return max(a1,a2,an if n 1 then return a if n-1 then return an if m> an then return m procedure mar(a1, a2, ?ntegers) , an: mmaa(a1,a2,...,an-1) if n-1 then return a if m an then return mm else return mar(a1,a2,... . an,) else return an

Explanation / Answer

The correct statements in order are:

procedure max(a1, a2, a3 ..... an : integers)

if n = 1 then return a1

m : = max (a1, a2, a3 ..... an-1)

if (m > an) return m

else return an

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.