MIPS ASSEMBLY QUESTION

insertionSort: Write a subprogram, called insertionSort, that sorts an integer array in increasing/ascending order using the insertion sort algorithm. The subprogram receives the beginning address of the array in $a0, and the array size in $a1. The array size can be 1 or more.

i 1

while i < length(A)

j i

while j > 0 and A[j-1] > A[j]

swap A[j] and A[j-1]

j j - 1

end while

i i + 1

end while