Question

Devise an algorithm that finds the product of all the integers in an input list of integers of length n. Use notation similar to

Procedure max(a1, a2,..., an: integers)
max = a1
for i = 2 to n
if ai > max then max = ai
return max

Hope someone can help. Thanks!