Chapter 11.3, Problem 13ES

To determine

(a)

To compute the actual number of elementary operations (addition, subtractions, multiplication, division and comparisons) that are performed when the algorithm segment is executed.

To determine

(b)

To find an order for the algorithm segment by using the theorem on polynomial orders.

for $i=1$ to $n-1$

for $j=i$ to $n$

if $a[j]>a[i]$ then do

$temp=a[i]$

$a[i]=a[j]$

$a[j]=temp$

End do

Next $j$

Next $i$