// time complexity: O(log(min(a, b))) where a and b are the two numbers
// space complexity: O(1)

package gcd

// Recursive finds and returns the greatest common divisor of a given integer.
func Recursive(a, b int64) int64 {
	if b == 0 {
		return a
	}
	return Recursive(b, a%b)
}