**Programming Question: Compute the Greatest Common Divisor of two integers (easy)**

This question is divided in two parts: you will first asked to write a function that computes the GCD withouth any space/time constraints. The second part will be more challenching, asking for not using multiplication or division or addition.

## Part1: write a function that takes two integers as input and returns their gcd using the famous Euclidean algorithm.

**Part 2: compute the Greatest Common Divisor of two integers without using multiplication addition or division operators (easy)**

Be the first to leave a comment. Don’t be shy.