Computer Science 269
Introduction to Data Structures
Fall 2000
Assignment 2 Due September 12, 2000

GCD is the greatest common divisor of two numbers. For example, gcd(2,6)=2, gcd(35, 56)=7.
Don't forget that:
gcd(0,a) = a, for every integer a.
gcd(1,b) = 1, for every integer b.
Write the algorithm as a function having as parameters the two integers and as returning value the gcd of the two numbers. The problems must be written by hand, and in your own handwriting and submitted in class. Do not write them into a computer file and then hand in a printout, and do not type your homework. Turn it in in class on September 12, 2000. Late assignments will not be accepted.