http://snipplr.com/users/skiabox/tags/common Recent snippets posted on Snipplr.com en-us Wed, 19 Jun 2013 18:26:47 GMT http://snipplr.com/view/42913/find-greatest-common-divisor-gcd-between-two--numbers/ Let m and n be variables containing the two numbers. If n is 0, then stop : m contains the GCD Otherwise, compute the remainder when m is divided by n. Copy n into m and copy the remainder into n. Then repeat the process, starting with testing whether n is 0.

]]> Mon, 25 Oct 2010 23:22:05 GMT http://snipplr.com/view/42913/find-greatest-common-divisor-gcd-between-two--numbers/