Question

Write a program in MIPS assembly language that implements the
bubble sort algorithm to sort a variablesized array of signed
32-bit integers (words) that are read from the console. A “special
value” 999 will be used to signify the end of the input sequence.
This value is not to be considered part of the input data set.
However, any value greater than 999 that is entered prior to 999 is
considered as a valid input. Zero and negative values are also
valid. Empty input sets are also valid. Your program must ask the
user if he/she wants to put in more values after the first sequence
of inputs. If yes, then repeat the sort algorithm just for new
inputs. Use the following algorithm, shown in Java-like syntax:
n=0; read in; while in != 999 { vals[n]=in; n++; read in; } for
(i=0;i vals[j+1]) { // swap temp=vals[j]; vals[j]=vals[j+1];
vals[j+1]=temp; } } } for (i=0;i