"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 :)
In questa pagina del sito puoi guardare il video online Find HCF/GCD using for loop || C++ PROGRAM della durata di ore minuti seconda in buona qualità , che l'utente ha caricato CodeSays 09 giugno 2021, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 720 volte e gli è piaciuto 12 spettatori. Buona visione!