the time complexity of brute force solution of gcd of two number is O(min(a,b)) cant it be 1

Question

when we use brute force to find gcd of two number (10,15) why is the time complexity O(min(a,b)) when both the numbers are same i have to run to half of it because gcd cant