Question

1- Write a MIPS assembly program to initialize register Ss0 to 8, register Ssl to 12, regis- ter Ss2 to 5, and register Ss3 to 2. Then, store register Ss0 in the first element of an array, register Ssl in the second element of the array, register Ss2 in the third element of the ar- ray, and register Ss3 in the fourth element of the array. Then, sort the elements of the ar- ray using the selection sort algorithm, and display the sorted array. Please submit the source code and a screen shot showing your code works correctly Note: The following is a part of selection sort program in C for (c 0; c < (n-1); c++) positionc if (arraylposition] > arrayid]) position-d if (position 1- c) swap arraylc]: array(c1 arraylposition]: array[position] swap;

Answer 1

Screenshot

-----------------------------------------------------------------------

Edlt Execute mips1 asin 05et paressters For hinction cel O Type hene to search A40-14-211

Program

#Declaration part
.data
     array: .space 16
#Program starts here
.text
     #Assign values
     addiu $s0,$0,8
     addiu $s1,$0,12
     addiu $s2,$0,5
     addiu $s3,$0,2
     addiu $t0,$0,4
     #Get address of the array
     la $t1,array
     #Insert values into array
     sw $s0,0($t1)
     sw $s1,4($t1)
     sw $s2,8($t1)
     sw $s3,12($t1)
     #Set parameters for function call
     addiu $a1,$0,4
     la $a0,array
     #Call sortfunction
     jal selectionSort
     #Print sorted array
     la $t0,array
loop:
    beq $a1,0,exit
    lw $a0,($t0)
    li $v0,1
    syscall
    li $v0,11
    li $a0,32
    syscall
    addiu $a1,$a1,-1
    addiu $t0,$t0,4
    j loop
#End of the program
exit:
    li $v0,10
    syscall
  
#Selection sort function
selectionSort:
     li $t0,0                       #for c
     li $t1,0                       #for d
     li $t2,0                       #for position
     move $t4,$a1                  #get array size in t4
     addi $t4,$t4,-1                #to get n-1
     move $s0,$a0                  #Get address of the array in s0
     move $s1,$a0                  #Get address of the array in s1
#c loop
firstLoop:
    beq $t0,$t4,returnSort        #for(int c=0;c<n-1;c++)
    lw $t5,($s0)                #value of index c into t5
    la $t2,($s0)                #set position=c
    addi $t1,$t0,1              #d=c+1
    addi $s0,$s0,4              #get next element as first element i j loop
    la $s1,($s0)                  #start fron c+1 index
#d loop
secondLoop:
     beq $t1,$a1,returnFirstLoop   #check n
     lw $t6,($s1)                  #comparison elemnt in t6
     ble $t5,$t6,next              #compare
#If greater
    la $t2,($s1)
    lw $t5,($t2)                #Get address of position,that is in t2
next:
    addi $t1,$t1,1             #Increment counter   
    addi $s1,$s1,4             #increment address to get next value
    j secondLoop                #Repeat
#Swap and return to first loop
returnFirstLoop:
    #store min in arr[i]
    addi $s0,$s0,-4         
    lw $t5,($s0)
    lw $t6,($t2)
    sw $t6,($s0)
    #store Arr[i] in arr[position]
    sw $t5,($t2)
    #Increment counter and address
    addi $t0,$t0,1
    addi $s0,$s0,4
    j firstLoop
#Reurn from function to main
returnSort:
    jr $ra

--------------------------------------------------------

Output

2 5 8 12