Implement the Euclidean algorithm into a Python function in order to calculate the largest common divisor of two numbers.

1. def euclid(numA, numB):
2.    while numB != 0:
3.      numRem = numA % numB
4.      numA = numB
5.      numB = numRem
6.   return numA