while y: x, y = y, x % y return x

This is the code for the Euclidean Algorithm. It is used to find the greatest common divisor of two numbers. 

## Conclusions and Future Directions

In conclusion, the three algorithms we used for the assignment were the Euclidean Algorithm, the Sieve of Eratosthenes, and the Karatsuba multiplication algorithm. We learned how to implement each algorithm and how they work. We also learned to code in python. 

For future work, we would like to implement more algorithms and learn more about how these algorithms work. In addition, we would like to learn more about the theoretical side of each algorithm.