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.

  Euclid's Algorithm (1.0 KiB, 6 hits)

Related posts:

1. Distraction: Modular Exponentiation
2. Mini-project: PeeweeGen

This entry was posted Thursday, May 13th, 2010 at 11:55 pm and is filed under Academia, Sci/Tech, Tips/Tricks. You can leave a response, or trackback from your own site.