Points$]$

$$ EPPDISCMATH$511\mathrm{.}3\mathrm{.}013.$

PREVIOUS ANSWERS

Consider the following algorithm segment. Assume that $n$ is a positive integer such that $n5,$

for $i$:$=1ton-3$

for $j$:$=jton$

$ifa[j]>a[j]$ then $do$

temp :$=a[j]$

$a[i]$:$=a[j]$

$a[j]$:$=$ temp

end $do$

next $j$

next $i$

implied by for$-$next loops. Express your answer in terms of $n.($Hint: See Example $11\mathrm{.}3\mathrm{.}3$ and exercises $11\mathrm{.}3\mathrm{.}11$a and $11\mathrm{.}3\mathrm{.}14$a in the "Read It$"$ link.$)$

The number of operations is $$

$($b$)$ Apply the theorem on polynomial orders to the expression in part $($a$)$ to find that an order for the algorithm segment is $n$