Greatest Common Divisor (GCD) of Big Numbers – A Recursive Approach (C++)

In this post I will provide mathematical background and C++ implementation of greatest common divisor (GCD) calculation of┬ábig numbers problem. Problem can be described as: You have two numbers to calculate their GCD. First number is very big, let say 250 digits long. Other number is not so long, maybe less than 6 digits. How … Continue reading Greatest Common Divisor (GCD) of Big Numbers – A Recursive Approach (C++)