Question: Write a MIPS program that does the following: Create an array of 21 INTEGERS, you can put whatever you want in it, but they shouldn't
Write a MIPS program that does the following:
Create an array of 21 INTEGERS, you can put whatever you want in it, but they shouldn't be sorted. Without using recursion:
a) Create a procedure to find the largest called findLargest
b) Create a procedure to find the smallest called findSmallest
c) Create procedure called range, which is the difference between the largest and smallest (range should call findLargest and findSmallest)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
