GCD algorithm

This week we are working on the first part of the exercises in Chapter $7.$

Assignment objective: After completing this assignment, you will have completed the following:

Analyze the shift and division applications

Implement multiplication and division instructions into a program

Create one program with all parts below. Be sure to copy your program into a $.$txt file for submission, with the output at the bottom. DON'T USE ANY CONDITIONAL CONTROL FLOW DIRECTIVES.

A$.$ The greatest common divisor $($GCD$)$ of two integers is the largest integer that will evenly divide both integers. Implement a function using the GCD algorithm that involves integer division in a loop, described by the following pseudocode:

C$.$ Put all of this in a loop that performs the GCD $3$ times. Make sure one of the times uses negative numbers to test the absolute value.

If you have any questions, you can post them on the discussion board or send me an email. You can email me programs to look at and provide help, at any time.

Keep it up$!$

I NEED MIPS VERSION THIS IS C VERSION I NEED MIPS VERSION BUT I GOT ERROR

$.$data

prompt: $.$asciiz "Enter two integers $($one of them can be negative for testing$)$: $"$

result$\_$msg: $.$asciiz $"$GCD of $\%$d and $\%$d is: $\%$d

$"$

newline: $.$asciiz $"$

$"$

$.$text

$.$globl main

# Function to calculate GCD

GCD:

li $t$0,0$ # Initialize remainder to $0$

bgtz $a$0,$ absX # Branch if x is positive

neg $a$0,$ $a$0$ # Negate x if it's negative

absX:

bgtz $a$1,$ absY # Branch if y is positive

neg $a$1,$ $a$1$ # Negate y if it's negative

absY:

beq $a$1,$ $zero, done # If y is zero, return x

gcdLoop:

div $a$0,$ $a$1$ # Divide x by y

mfhi $t$0$ # Remainder stored in t$0$

move $a$0,$ $a$1$ # Move y into x

move $a$1,$ $t$0$ # Move remainder into y

bnez $a$1,$ gcdLoop # If y $!=0,$ repeat loop

done:

move $v$0,$ $a$0$ # Return GCD in v$0$

jr $ra

main:

li $t$2,3$ # Loop counter

loop:

beqz $t$2,$ exit$\_$loop # Exit loop if it's been executed $3$ times

# Print prompt

li $v$0,4$

la $a$0,$ prompt

syscall

# Read x

li $v$0,5$

syscall

move $t$0,$ $v$0$ # Store x in $t$0$

# Read y

li $v$0,5$

syscall

move $t$1,$ $v$0$ # Store y in $t$1$

# Ensure the larger number is passed first

bge $t$0,$ $t$1,$ calcGCD # If x $>=$ y$,$ calculate GCD

move $t$4,$ $t$0$ # Otherwise, swap x and y

move $t$0,$ $t$1$

move $t$1,$ $t$4$

calcGCD:

move $a$0,$ $t$0$ # Pass x

move $a$1,$ $t$1$ # Pass y

jal GCD # Call GCD function

move $t$3,$ $v$0$ # Store GCD in $t$3$

# Print result message

li $v$0,4$

la $a$0,$ result$\_$msg

syscall

# Print x

li $v$0,1$

move $a$0,$ $t$0$

syscall

# Print $"$ and $"$

li $v$0,4$

la $a$0,$ newline

syscall

# Print y

li $v$0,1$

move $a$0,$ $t$1$

syscall

# Print $"$ is: $"$

li $v$0,4$

la $a$0,$ newline

syscall

# Print GCD

li $v$0,1$

move $a$0,$ $t$3$

syscall

# Print newline

li $v$0,4$

la $a$0,$ newline

syscall

sub $t$2,$ $t$2,1$ # Decrement loop counter

j loop

exit$\_$loop:

li $v$0,10$ # Exit program

syscall