PLZ READ Must be in mips and ran through MARS$($The code i provided keaps looping asking the question how many numbers i want to enter$($If my code does not meet the requirements plz add on to it or make a new one$)$

Requirements:

use $2$ functions

paremeter to first function should be the size of the array, than you fill up the array

in main, pass size to find median function

$.$Use passing and returning

$.$must use this lines of code

$.$add $a$1,$$$0,$$t$5$ # Passing to function by $a$1$

add $a$2,$$$0,$$t$6$ # Passing to function by $a$2$

$.$add $t$0,$ $v$1,$ $$0$

$.$add $t$5,$$$0,$$a$1$ # Passing to function by $a$1$

add $t$6,$$$0,$$a$2$ # Passing to function by $a$2$

$.$add $v$1,$ $t$7,$ $$0$ # returning the result to main

Look at photo provided plz uses Mips Main prints the madian

How many number you like to enter: $9$

Enter number $1$: $10$

Enter number $2$: $20$

Enter number $3$: $30$

Enter number $4$: $40$

Enter number $5$: $50$

Enter number $6$: $60$

Enter number $7$: $70$

Enter number $8$: $80$

Enter number $9$: $90$

The median is: $50$

How many number you like to enter: $6$

Enter number $1$: $11$

Enter number $2$: $15$

Enter number $3$: $16$

Enter number $4$: $18$

Enter number $5$: $212$

Enter number $6$: $220$

The median is: $17$

$===============================$

How many number you like to enter: $6$

Enter number $1$: $11$

Enter number $2$: $15$

Enter number $3$: $18$

Enter number $5$:$23$

Enter number $6$: $220$

Enter number $7$: $221$

The median is: $20$

$===============================$

the middle is $20\mathrm{.}5$ in the last case but since we only deal with integer we get the integer part

which is $20.$

PLZ READ

Requirements:

use $2$ functions

paremeter to first function should be the size of the array, than you fill up the array

in main, pass size to find median function

$.$Use passing and returning

$.$must use this lines of code

$.$add $a$1,$$$0,$$t$5$ # Passing to function by $a$1$

add $a$2,$$$0,$$t$6$ # Passing to function by $a$2$

$.$add $t$0,$ $v$1,$ $$0$

$.$add $t$5,$$$0,$$a$1$ # Passing to function by $a$1$

add $t$6,$$$0,$$a$2$ # Passing to function by $a$2$

$.$add $v$1,$ $t$7,$ $$0$ # returning the result to main

My Code:

$.$data

array: $.$space $100$ # Assuming a maximum size for the array

newline: $.$asciiz $"$

$"$

prompt: $.$asciiz "How many numbers you'd like to enter: $"$

$.$text

main:

# Prompt user for the size of the array

li $v$0,4$

la $a$0,$ prompt

syscall

# Read the size of the array

li $v$0,5$

syscall

move $s$0,$ $v$0$ # $s$0$ contains the size of the array

# Fill up the array in main

jal fillArray

# Pass the size to the findMedian function

move $a$0,$ $s$0$

jal findMedian

# Print the result

li $v$0,1$

move $a$0,$ $v$0$ # $v$0$ contains the median

syscall

# Exit program

li $v$0,10$

syscall

fillArray:

# $a$0$: size of the array

# $s$0$: base address of the array

# $t$0$: loop counter

la $s$0,$ array # Load base address of the array

fill$\_$loop:

# Prompt user for array elements

li $v$0,4$

la $a$0,$ newline

syscall

li $v$0,4$

la $a$0,$ prompt

syscall

li $v$0,5$

syscall

# Store the entered number in the array

sw $v$0,0($$s$0)$

addi $s$0,$ $s$0,4$ # Move to the next array element

addi $t$0,$ $t$0,1$ # Increment loop counter

blt $t$0,$ $a$0,$ fill$\_$loop # Repeat until the array is filled

jr $ra # Return to main

findMedian:

# $a$0$: size of the array

# $s$0$: base address of the array

# $v$0$: median value

la $s$0,$ array # Load base address of the array

move $t$5,$ $a$0$ # Copy the size of the array to $t$5$

# Sort the array in ascending order $($bubble sort$)$

sort$\_$loop:

li $t$1,1$ # Set flag to $1$ to start a new pass

# Compare and swap adjacent elements

sub $t$5,$ $t$5,1$

move $t$6,$ $t$5$ # Copy the current size of the array

element$\_$loop:

lw $t$2,0($$s$0)$ # Load current element

lw $t$3,4($$s$0)$ # Load next element

bge $t$2,$ $t$3,$ no$\_$swap # If current element is not greater than next element, do not swap

# Swap elements

sw $t$2,4($$s$0)$

sw $t$3,0($$s$0)$

no$\_$swap:

addi $s$0,$ $s$0,4$ # Move to the next array element

addi $t$6,$ $t$6,-1$ # Decrement loop counter

bnez $t$6,$ element$\_$loop # Repeat until all elements are compared

bnez $t$1,$ sort$\_$loop # If a swap occurred in the pass, repeat the sorting

# Calculate the median

li $v$0,0$ # Initialize median value to $0$

la $s$0,$ array # Load base address of the array

li $t$7,2$ # Divide by $2($integer division$)$

divu $t$7,$ $t$7,2$ # Divide by $2$

mflo $t$7$ # Copy quotient to $t$7$

add $s$0,$ $s$0,$ $t$7$ # Move to the middle element of the sorted array

lw $v$0,0($$s$0)$ # Load the median value

jr $ra # Return to main