Write a program which defines total m integer numbers in pre-defined data area \

Question

Write a program which defines total m integer numbers in pre-defined data area 'var_a'. Implement procedure 'gcd' which takes two argument in $a1 and $a0 and return GCD (Greatest Common Divisor) in $v0. Implement another procedure 'lcm' which takes two argument in $a1 and $a0 and return LCM (Least Common Multiplies) in $v0. This 'lcm' procedure uses 'gcd' procedure internally. Implement another procedure 'gcd_lcm_set' which takes two argument $a0 as address to the start of array var_a and $a1 as number of elements in the array. It returns GCD of the set of numbers in $v0 and LCM of the set of the number in $v1. The 'main' program prints GCD and LCM value of the given array of integer numbers in var_a. Name the program as gcd_lcm_arr.asm

In MIPS.

Explanation / Answer

static void Main(string[] args) { Console.WriteLine("GCD of {0} and {1} is {2}", 1, 1, gcd(1, 1)); Console.WriteLine("GCD of {0} and {1} is {2}", 1, 10, gcd(1, 10)); Console.WriteLine("GCD of {0} and {1} is {2}", 10, 100, gcd(10, 100)); Console.WriteLine("GCD of {0} and {1} is {2}", 5, 50, gcd(5, 50)); Console.WriteLine("GCD of {0} and {1} is {2}", 8, 24, gcd(8, 24)); Console.WriteLine("GCD of {0} and {1} is {2}", 36, 17, gcd(36, 17)); Console.WriteLine("GCD of {0} and {1} is {2}", 36, 18, gcd(36, 18)); Console.WriteLine("GCD of {0} and {1} is {2}", 36, 19, gcd(36, 19)); for (int x = 1; x < 36; x++) { Console.WriteLine("GCD of {0} and {1} is {2}", 36, x, gcd(36, x)); } Console.Read(); } // Greatest Common Denominator using Euclidian Algorithm // Gist: https://gist.github.com/SecretDeveloper/6c426f8993873f1a05f7 static int gcd(int a, int b) { return b==0 ? a : gcd(b, a % b); }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.