3n+1 assignment sollution

3n_plus_one.js

    function isOdd(n){
        return (n & 1);
    }

    function getStepCount(n, c){
        var count = c | 0;
        count++;
        if(n < 1){
            return 0;
        }else if(n == 1){
            return count;
        }else if(isOdd(n)){
            return getStepCount(3*n+1, count);
        }else{
            return getStepCount(n/2, count) ;
        }
    }

    function getMaximumStep(i,j){
        if(i>j){
            return "Wrong Input";
        }
        var data = {
            max_step:0,
            max_step_n:false
        };

        for(n=i; n<=j; n++){
            var current_steps = getStepCount(n);
            if( current_steps > data.max_step ){
                data.max_step = current_steps;
                data.max_step_n = n;
            }
        }

        return "Maximum Step (" + data.max_step + ") Needed for number : " + data.max_step_n;
    }

    var n= prompt('Please enter value of i,j','');
    n = n.split(',');

    document.write(getMaximumStep(n[0],n[1]));