HailstoneLengthQuick

HailstoneLengthQuick.java

public class HailstoneLengthQuick {	
	public static void main(String[] args) {
		int max = 0;
			int lower = Integer.parseInt(args[0]);
			int upper = Integer.parseInt(args[1]);	
		for (long n = upper; n >= lower; n--) {
			long workingN = n;
			int count = 2;
			while (workingN!=2) {
				count++;
				workingN = ((workingN&1) == 0) ? workingN>>1 : (3*workingN) +1;			
			}
			if (count > max) {
				max = count;
			}
		}
		System.out.println(lower + " " + upper + " " + max);
	}
}