Euclid GCD Algorithm Why it works
Euclid gcd algorithm is a procedural way to find GCD(greatest common devisor)/HCF(highest common factor) of two numbers it is super fast and preferred way of calculating gcd for computer programs it has a simple logic
let us assume two numbers
a=54;
...
