Can anyone help $me$ with code, I have attached the prompt, but $my$ code seems $to$ keep looping and doesn't stop $at$ the $n$ amount $of$ elements the user enter:

$.$data

# Prompt for n

li $v$0,4$

la $a$0,$ prompt$1$

syscall

# Read n

li $v$0,5$

syscall

move $s$0,$ $v$0$ # $s$0$ will store n

# Check if n is within range

li $t$0,0$

li $t$1,11$

blt $s$0,$ $t$0,$ exit$\_$program

bgt $s$0,$ $t$1,$ exit$\_$program

# Call fill$\_$array$\_$function

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

jal fill$\_$array$\_$function

# Call find$\_$median

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

jal find$\_$median

move $s$1,$ $v$0$ # $s$1$ will store the median

# Print the median

li $v$0,1$

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

syscall

# Exit program

j exit$\_$program

fill$\_$array$\_$function:

# Loop to fill the array

li $t$0,0$ # i $=0$

la $t$1,$ array # Address of array

fill$\_$loop:

beq $t$0,$ $a$0,$ sort$\_$array # Exit loop if i $==$ n

# Prompt for element

li $v$0,4$

la $a$0,$ prompt$2$

syscall

# Read element

li $v$0,5$

syscall

sw $v$0,($$t$1)$ # Store element in array

addi $t$0,$ $t$0,1$ # Increment i

addi $t$1,$ $t$1,4$ # Move to next array element

j fill$\_$loop

sort$\_$array:

# Bubble sort

li $t$0,1$ # Assume sorted

la $t$1,$ array

sort$\_$outerloop:

li $t$0,0$ # Assume unsorted for this pass

li $t$2,0$ # i $=0$

sort$\_$innerloop:

bge $t$2,$ $s$0,$ sort$\_$done # Exit inner loop if i $>=$ n

lw $t$3,($$t$1)$ # Load a$[$i$]$

lw $t$4,4($$t$1)$ # Load a$[$i$+1]$

ble $t$3,$ $t$4,$ no$\_$swap # If a$[$i a$[$i$+1],$ no swap needed

sw $t$4,($$t$1)$ # Swap a$[$i$]$ and a$[$i$+1]$

sw $t$3,4($$t$1)$

li $t$0,1$ # Set sorted flag to $1$

no$\_$swap:

addi $t$1,$ $t$1,4$ # Move to next array element

addi $t$2,$ $t$2,1$ # Increment i

j sort$\_$innerloop

sort$\_$done:

bne $t$0,1,$ sort$\_$outerloop # If sorted flag still $0,$ array is sorted

j find$\_$median

find$\_$median:

# Median calculation

li $t$0,2$ # $2/2=1($index of median$)$

la $t$1,$ array

add $t$1,$ $t$1,$ $s$0$ # Point to last element

sll $t$2,$ $s$0,2$ # Multiply n by $4($to get number of bytes$)$

sub $t$1,$ $t$1,$ $t$2$ # Point to middle element

lw $v$0,($$t$1)$ # Load middle element as median

jr $ra

exit$\_$program:

li $v$0,10$ # Exit syscall

syscall