Sunday, 4 June 2023

GCD/HCF optimized

How to calculate GCD/HCF with optimization.

Step 1 : Calculate Remainder between A and B.

Step 2 : Change A with B and B with remainder obtained

Step 3 : Do this recursively till we get B as 0

 

Note : A > B, if its not the case then change B and A.

Code :










at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Count of digits in factorial

 To count the digits in a factorial we must seek some optimization as you might also understand that getting all the product and storing the...

  • Count of digits in factorial
     To count the digits in a factorial we must seek some optimization as you might also understand that getting all the product and storing the...
  • GCD/HCF optimized
    How to calculate GCD/HCF with optimization. Step 1 : Calculate Remainder between A and B. Step 2 : Change A with B and B with remainder obta...
  • LCM optimized
     Optimized solution to find LCM We can use the formula : A * B = GCD(A,B) * LCM(A,B) (simple pair hai ye....) As, LCM(A,B) = (A*B) / GCD(A,B...