Find HCF/GCD using for loop || C++ PROGRAM
"Find HCF/GCD using for loop", C++ PROGRAM.
The logic of this program is simple.
In this program, the smaller integer between [ n1 ] & [ n2 ] is stored in [ n2 ]. Then the loop is iterated from i=1 to i is less than equal to n2 and in each iteration, the value of i is increased by 1.
If both numbers are divisible by [ i ] then, that number is stored in variable [ hcf ].
This process is repeated in each iteration. When the iteration is finished, HCF will be stored in variable [ hcf ].
Source Code link :
https://codesayswebsite.blogspot.com/...
CodeSays Website link :
https://codesayswebsite.blogspot.com/
All Source Codes are available here :
https://codesayswebsite.blogspot.com/
#COMPUTERLANGUAGE :)
On this page of the site you can watch the video online Find HCF/GCD using for loop || C++ PROGRAM with a duration of hours minute second in good quality, which was uploaded by the user CodeSays 09 June 2021, share the link with friends and acquaintances, this video has already been watched 720 times on youtube and it was liked by 12 viewers. Enjoy your viewing!
