Task: Analyze Time Complexity of Euclid's GCD Algorithm

Task: Analyze Time Complexity of Euclid's GCD Algorithm: a task in Terminal-Lego-15k (Harbor dataset). You need to implement Euclid's Greatest Common Divisor (GCD) algorithm and empirically analyze its time complexity by counting the number of iterations for various inputs.