Assignment $4$ Directions

Create an algorithm to sort the numbers in ascending order in a list of $3-5$ numbers using at least one function called by the main program.

Implement the program in a high level language like C$,$ C$++,$ or Java. Use the code in the comments of your program to show it was written in a high level language first.

Implement the program in MIPSzy Assembly language.

If you write that MIPSzy program in a text editor, you should then paste it into the simulator box in $11\mathrm{.}1\mathrm{.}2.$ You can run the simulation there to test the code.

The input value values should be entered in the input box. Enter the numbers to test separated by spaces. Do not worry about whether they move to another line or not.

Input works by placing the value to be read in 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.$

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$4.$txt$.$

Zip up FirstnameLastnameA$4.$txt into a zip file called FirstnameLastnameA$4.$zip. Do not use any other kind of zip file formats. I do not need the high level language program.

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: $9945682100$

Output: $6358299100$

A sample program to show how to manage input and output is as follows. Type a single digit positive 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?

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

beq $t$5,$ $zero, NoInput

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

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

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

sw $t$2,0($$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,0($$t$0)$ # Output to screen

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

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

j BegLoop

NoInput: