Compare the text$$s implementation of insertion sort with the following ver$-$

sion.

ALGORITHM InsertSort$2($A$[0..$n $1])$

for i $1$ to n $1$ do

j $$i$1$

while j $0$ and A$[$j $]>$ A$[$j $+1]$ do

swap$($A$[$j $],$ A$[$j $+1])$

j $$j $1138$

What is the time ef$$ciency of this algorithm? How is it compared to that

of the version given in Section $4\mathrm{.}1?$