Compute the greatest common divisor of two integers, u and v, expressed in binary. The run time complexity is O((log₂ u v)²) bit operations.