INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key
INSERTION-SORT(A)
for j<-2 to lenth[A]
do key <- A[j]
i<-j-1
while i>0 and A[i]>key
do A[i+1]<-A[i]
i<-i-1
A[i+1]<-key