Chapter 11.3, Problem 12ES

For each of the algorithm segments in 6—19, assume that n is a positive integer. (a) Compute the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed. For simplicity, however, count only comparisons that occur within if then statements; ignore those implied by for-next loops. (b) Use the theorem on polynomial orders to find an order for the algorithm segment.

12. for $k:=1$ to $n-1$ $max:=a\left[k\right]$for $i:=k+1$ to nif $max<a\left[i\right]$ then $max:=a\left[i\right]$ next i $a\left[k\right]:=max$next k