Java code for Finding GCD ( Greatest Common Divisor ) or GCF of two numbers

This program demonstrates the logic and code for finding GCD ( Greatest Common Divisor ) or GCF ( Greatest Common Factor ) for the given two numbers.
Example: for 10, 15 , the GCD is 5 and for 36,60 the GCD is 12.
This program we have implemented using Euclidiean algorithm based on subtraction and division.
If you like this video, don't forget to subscribe , like and share this video
Please promote this channel , by sharing it with your friends who are searching / preparing for IT jobs in programming..
If you have any coding challenges ( questions ) , post them in the comment, we will upload the videos for the same

[@codewaythamizha4173]

Thankyou

[@dristidugar6311]

SUPERB explanation.

[@gitamittala2795]

The GCD OF ZERO AND A NON-ZERO NUMBER IS , NON ZERO NUMBER. EX: gcd(a,0) is a, not zero.The first if Clause is wrong.

[@gitamittala2795]

You should have use AND operator instead of OR operator in first if statement.

[@ibrahimshaikh9179]

Well explained sir✌

[@kamalanb6930]

Thanks a lot. It was really helpful 😊

[@munidinesh9775]

thanks bigtime

[@mustapharaimilawal8053]

Hello Sir, thanks for this awesome tutorial, can you please solve some java interview questions on singly linked list? Thank you.

[@pinkubose2994]

10 is also divisible by 10.

[@worldnewsvideos]

thank you

[@allenrubiks4166]

Sir, Is this program a kind of recursive function???

[@yosiefberhe4974]

Can it be done by while loop too? i have a problem with the while loop, it kind of confuse me?

[@aqua6150]

Beautifully explained. But its less beautiful then Me.

[@yashwantbhagawat2710]

what will be the time complexity of this program

[@akshatpanwar6260]

Take 2 numbers 22 and 7 you will not get ans