sureshkumar
GCD
Posted in : Java Beginners

WRITE PROGRAM TO FIND GREATEST OF TWO NUMBERS?

April 15, 2011 at 11:09 AM

```import java.util.*;

public class GCDOFNumbers {
public static int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
public static void main(String[] args){
Scanner input = new Scanner(System.in);
System.out.print("Enter Number 1: ");
int num1 = input.nextInt();
System.out.print("Enter Number 2: ");
int num2 = input.nextInt();
int gcdOfNum = GCDOFNumbers.gcd(num1, num2);
System.out.println("HCF of two numbers " + num1 + "," + num2+ " is: " + gcdOfNum);
}
}
```

gcd
gcd  . Write a method that returns the greatest common divisor (gcd) of two integers. For example, if the two integers are 6 and 15, the gcd is 3. Another example, if the two integers are 8 and 25, the gcd is 1. The two integers
Find HCF of three numbers in Java Program
Find HCF of three numbers in Java Program In this java tutorial section, you will learn how to determine the HCF (Highest Common Factor) or GCD (Greatest Common Divisor) of three numbers. As you already know that HCF or GCD
XII STD RECURSION WITHOUT SCANNER
in the function gcd_func in the last condition giving stack overflow null. .I do...()); int gcd=1; int i=2; int p= gcd_func(a,b,gcd,i); System.out.println( "GCD+ +"+p); } int gcd_func(int a, int b, int gcd, int i
programes on while loop
programes on while loop   write a program to calculate sum of an entered digit write a program to find gcd and lcm of 2 positive integers   Java sum of digits Java Find LCM and GCD
Math Program - Java Beginners
the GCD for the entered numbers.  Hi Friend, Try the following code: import java.util.*; class GCD{ public static int determineGCD(int... Exception { GCD cal = new GCD(); Scanner input=new Scanner
javaprograms
javaprograms  write GCD program in java   import java.util.*; public class GCDOFNumbers { public static int gcd(int a, int b... a; else return gcd(b, a % b); } public static
javaprograms
javaprograms  write GCD program in java   import java.util.*; public class GCDOFNumbers { public static int gcd(int a, int b... a; else return gcd(b, a % b); } public static
Java BigInteger
methods for the operations for modular arithmetic such as GCD calculation...()   BigInteger gcd(BigInteger val) This method is used to find out... BigInteger value. Syntax : public BigInteger gcd(BigInteger val)   int
questions
2. write a program to find gcd and lcm of 2 positive integers Q. 4...questions   Q. 1 programes on if....else 1. write a program... of a student out of 100 and print grades using else .... if ladder Q. 2
Tutorials