INSERTION$-$SORT$($A$)$

$1$ for j $=2$ to A$.$length

$2$ key $=$ A$[$j$]$

$3//$ Insert A$[$j$]$ into the sorted sequence A$[1..$j$-1]$

$4$ i $=$ j $-1$

$5$ while i $>0$ and A$[$i$]>$ key

$6$ A$[$i$+1]=$ A$[$i$]$

$7$ i $=$ i $-1$

$8$ A$[$i $+1]=$ key

Question: If we were to modify line $1$ from "for j $=2$ to A$.$length" to "for j $=1$ to A$.$length", would the insertion sort algorithm still be able to sort a list?