I want the algorithm for the attaced code. " input , output , process"

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

I want the algorithm for the attaced code. " input , output , process"

the code is written in java

 

1 import java.util.Scanner;
2 public class GCD2
/** Main method */
public static void main(String[] args) {
// Create a Scanner
Scanner sc = new Scanner(System. in);
<terminated> GCD2 [Java Application] C:\Program Files\.
Enter first integer: 75
Enter second integer: 125
The GCD for 75 and 125 is 25
40
7
// Prompt the user to enter two integers
System.out.print("Enter first integer: ");
int X = sc.nextInt();
System.out.print("Enter second integer: ");
int Y = sc.nextInt();
8
10
11
12
13
14
15
System.out.println("The GCD for " + X +
and
+ Y +
" is " + gcd(X, Y));
}
16
17
18-
19
20
21
22
23
24
25
26
27
28
/** Return the gcd of two integers */
public static int gcd(int X, int Y) {
int gcd = 1; // Initial gcd is 1
int i = 1; // Possible gcd
while (i <= X && i <= Y) {
if (X % i == 0 && Y % i == 0)
gcd = i; // Update gcd
i++;
}
return gcd; // Return gcd
}
29 }
Transcribed Image Text:1 import java.util.Scanner; 2 public class GCD2 /** Main method */ public static void main(String[] args) { // Create a Scanner Scanner sc = new Scanner(System. in); <terminated> GCD2 [Java Application] C:\Program Files\. Enter first integer: 75 Enter second integer: 125 The GCD for 75 and 125 is 25 40 7 // Prompt the user to enter two integers System.out.print("Enter first integer: "); int X = sc.nextInt(); System.out.print("Enter second integer: "); int Y = sc.nextInt(); 8 10 11 12 13 14 15 System.out.println("The GCD for " + X + and + Y + " is " + gcd(X, Y)); } 16 17 18- 19 20 21 22 23 24 25 26 27 28 /** Return the gcd of two integers */ public static int gcd(int X, int Y) { int gcd = 1; // Initial gcd is 1 int i = 1; // Possible gcd while (i <= X && i <= Y) { if (X % i == 0 && Y % i == 0) gcd = i; // Update gcd i++; } return gcd; // Return gcd } 29 }
Expert Solution
Step 1

Here we write a simple algorithm of gcd of two numbers:

==================================================================

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education