Wednesday, February 26, 2014

To find the hcf between two numbers using recursion function


By on 11:00 PM

In this program I have given the concept of finding the hcf between two numbers using function.
The highest common factor of integers x and y is the largest integer that evenly divides both x and y.
The main points to be remember while doing this program is:

If y is equal to 0, then hcf(x,y) is x,
otherwise
hcf(x,y) is hcf(y,x%y)
 The main source code of the program is given below:

About Authors

Aakash and Shreeram are owners of this website. Both are engineering student. Aakash is studying computer engineering and has passion with blogs and love to play with it while Shreeram is studying civil engineering and has dream of implementing technology in practical life.

0 comments :

Post a Comment