minimum number of steps to reduce number to 1

Question

Given any number n, and three operations on n:

1. add 1
2. subtract 1
3. divide by 2 if the number is even

I want to find the minimum n

Answer 1

I am really bad at binaries so not counting the lsb or msb. What about below program -

public class ReduceNto1 {
    public static void main(String[] args) {
        int count1 = count(59);//input number
        System.out.println("total min steps - " + count1);
    }
    static int count(int n){
        System.out.println(n + " > ");
        if(n==1){
            return 0;
        }
        else if(n %2 ==0){

            return 1 + count(n/2);
        }else{
            return 1 + Math.min(count(n-1), count(n+1));
        }
    }
}