1st problem:

need help writing a MIPS program that does the following (there is C++ sample code below to explain the logic):

1st problem:

1) Create an array of 21 INTEGERS, you can put whatever you want in it, but they shouldn't be sorted. Without using recursion:

2) Create a procedure to find the largest called find largest

3) Create a procedure to find the smallest called find smallest.

4)Create a procedure called range, which is the difference between largest and smallest (range should call find largest and find smallest)

2nd problem:

Write a MIPS program that will handle calculating mini float addition for two numbers using the rules discussed in class and storing each of the parts as a binary integer.

To do this, each 'mini float' number will need to be represented ( suggest hardcoded) as one register for the sign, one for the exponent part, one for the 'significand'(which you then convert to the fraction part). Hard coding means here that you don't need to read in the 6 parts as user input, just have something like

li $s0, 0

li $s1, 12

li $s2, 5

which is equivalent to a minifloat of 0 1101 101 = 1.101 * 2^(12-7) = 1.101*2^5

This means the program will be work with at least 6 registers as variables.