Determine the least number of comparisons, or best-case performance,

a) required to find the maximum of a sequence of n integers, using Algorithm 1 of Section 3.1.

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

max := a1

for i := 2 to n

if max < ai then max := ai

return max{max is the largest element}

b) used to locate an element in a list of n terms with a linear search.