While reviewing modular exponentiation, I got bored and decided to write this program instead. I have not yet finished writing my bigInt calculator I started working on a while back, so, my program only works for numbers smaller than 2^64 bits.

While studying for my Introduction to Algorithms final, I decided I wanted to take a break and write a simple program in C++ to calculate the GCD of two numbers using Euclid’s Algorithm.