CountingSort$($A$,$ B$,$ k$)\{$

Let $C[0$dotsK$]$ be a new array

for $i=O$ to $k$

$C[i]=0$

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

$,C[A[j]]=C[A[j]]+1$

for $i=1$ to $k$

$C[i]=C[i]+C[i-1]$;

$,$ for $j=$ A$.$length downto $1$

$B[C[A[j]J]]=A[j]$

$C[A[j]]=C[A[j]]-1$

If we were to change line $8$ to "for $j=1$ to A$.$length", would counting$-$sort still sort an array?

True

False