Very simple classic problem
It's also known as the famous Collatz Conjecture
He believes that if a number is odd, multiply by 2 and add 1
If it's even, divide by 2
This cycle will eventually reach 1
The task is to calculate the cycle count of all numbers in the range
And extract the maximum cycle count
Note that initially a and b may not be a~b, it could be b~a