Question

Transfer C code of selection sort to MIPS code and print the sorted array/results

data Array: word 43, -5, 11, 12, 64, -7, 14, 71, 70, 13, -27 string: asciz"In" # Trantec the C code of selection sort to MIPS code. Do not modify the existing code and structure! text main la ŞtO, Array li $t1, 0 li $t7,11 mul $17, $17, 4 subi $t8,$t7, 4 # array length n-11 # 4*n #4*(n-1) # lis in $t1 and j is in $t2 add $t2, $t1, 4 # write your code here for Selection Sort # write your code here to print the sorted array/result # exit addi SvO, Şzero, 10 xscall Implement this selection sort for (int i-0; isn-1; ittl if alij ali int temp alil a[i] = a[j]; alil -temp Here is an example output: -27 -7 12 13 43 64 70 71

Answer 1

# prompt over li $ v0 4 la $ a0, prompt syscall li $ v0, y $ a_0 , next time syseall \r\n input # user enter 10 integer beq , $ t1 $ # 0 mov $ a_0 , $ + 9 li $ v0, syseall li $ v0 la $ v0, 5 sys eall mov $ t2, $vo w $ t^2 array ($ t 1) addi $ t1 $ t1 , 4 addi $ t9, $t9, 1 j input # the region mean $ t1, $ zero mov $ t2, $ zero addi $t2, $ zero addi $ t2, $ t2, 4 move $ s0, $ zero addi $50 , $ so, 1 \r\n sorting beq $ t3, $ t4, calculate beq $ t2 , $t0 continous low $ t5 array ($ t1) low $ t6, array ($t2) addi 4 t3, $t3, 1 $t7, $ t6, $ t5, // if [a] [i]