AT PUE 01

1.1

a)

Data: Array $A$, $n=$ length($A$), i
Result: $A$
Code:
$A:=A+[i]$
$i:=1$
while $i<length(A)$ do
$j:=1$
while $j>0$ and $A[j-1]>A[i]$ do
swap $A[j]$ and $A[j-1]$
$j:=j-1$
$i:=i+1$