Gcd program in java

Java Training Java Tutorial. Abstract class Interface Abstract vs Interface. Package Access Modifiers Encapsulation. Next Topic Java Programs. Reinforcement Learning. R Programming. React Native. Python Design Patterns. Python Pillow. Python Turtle. Verbal Ability.

Interview Questions. Company Questions. Artificial Intelligence. Cloud Computing. Java ArrayList. Popular Examples Check prime number. Print the Fibonacci series. Print Pyramids and Patterns. Multiply two matrices. Find the standard deviation. Reference Materials String. Start Learning Java. Explore Java Examples. Java Examples Check Leap Year. Check Whether a Number is Positive or Negative.

Thus, GCD is the highest number that divides two or more than two given numbers completely. Explanation: The GCD of any two numbers is always less than or equal smallest of the given numbers, which serve the condition of our for-loop. The for-loop runs from 1 to the minimum of the given numbers. In each iteration, we check whether the given numbers are divisible by the loop variable i or not.

If the variable i divides both the numbers, we update the value of the ans variable else the variable ans remains the same. Explanation: We are reducing the given numbers by subtracting the smaller number from the larger one and continue to do so until both the numbers are equal.

Explanation: In the above approach, we are finding all the factors of the given numbers and storing those factors in the lists. Then we are converting those lists into integer arrays. The first integer array contains all the factors of the first input number, and the second integer array contains the factors of the second input number. Recommended Articles. How to compute the average of an array after mapping each element to a value in JavaScript?

Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide. Load Comments.