Create an algorithm to sort a list of up to $5$ numbers. $($Note that you can use brute force to search for the

smallest number in the list each time through the loop or implement a sorting algorithm.$)$

Implement the program in a high level language like C$,$ C$++,$ or Java.

Implement the program in MIPSzy Assembly language. Use the high level code as comments to the right

of the Assembly code as the textbook does.

Input works by placing the value to be read in from the input box in memory location $8196$ and a $1$ in

memory location $8192.$ If there is no more input a $0$ will be placed in memory location $8192.$ as a space

delimited list.

Results should be written to memory location $8200$ which will cause them to be written to the output

window.

Include a comment at the top of the program with your name and Panther id$.$

Export the file by clicking the "More Options" button and then Export on the right side. That will paste

your program into a small box on the right. Copy and paste that into a text document. Call that document

FirstnameLastnameA$3.$txt$.$

Submit FirstnameLastnameA$3.$txt$.$

I will show how to work with the input output simulation window during the live Zoom session which can be

watched in the recording if you miss the live class.

Here is a sample of the input and output:

Input: $527831994$

Output: $431527899$

A sample program to show how to manage input and output is as follows. Type a single digit integer number in

the Input box and run the program.

addi $t$0,$ $zero, $8200$ # Output loc

BegLoop:

addi $t$6,$ $zero, $8192$ # Input ready?

Iw $t$5,0($$t$6)$

beq $t$5,$ $zero, Nolnput

addi $t$6,$ $zero, $8196$ # Input loc

Iw $t$1,0($$t$6)$

addi $t$2,$ $zero, $1$

sw $t$2,$ O$($$t$0)$ # Output to screen

mul $t$2,$ $t$2,$ $t$1$ # Times Input

sw $t$2,0($$t$0)$ # Output to screen

mul $t$2,$ $t$2,$ $t$1$ # Times Input

sw $t$2,$ O$($$t$0)$ # Output to screen

mul $t$2,$ $t$2,$ $t$1$ # Times Input

sw $t$2,$ O$($$t$0)$ # Output to screen

j BegLoop

Nolnput: