Consider sorting $n$ keys $($numbers$)$ in array $A$ by first finding the smallest element of A and putting it first. Then find the second smallest of A and put it second. Continue in this manner for the $n$ elements of $A.$ This algorithm is known as SELECTION$-$SORT; the pseudocode is shown below.

Algorithm: SELECTION$-$SORT$($A$)$

$n=$ length $A$

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

smallest $=i$

for $j=i+1$ to $n$ :

if $)$

$(numberof$ key comparisons $is$ the equal $to$ the sum $of$ key comparisons $in$ each i loop