You may implement any sorting algorithm but should aim for a complexity of O$($n $)$ or better.

Complete the code in ArrSort.asm

Inputs:

R$1$ contains the RAM address of the first element in the array

R$2$ contains the length of the array

Outputs:

Write your True $(-1)$ to R$0$ when your program finishes.

The correctly sorted array should replace the original array in its location.

Test Cases:

Write at least $5$ test cases.

A sample test case is provided in ArrSort$00.$tst

Each test case should be in a file named ArrSortXX.tst where XX is a number starting at

$01.$

You should also submit any supporting files such as CMP files.