Prime Checker

  • + 0 comments

    To avoid the i*i calculus in each loop:

    long maxDivider = Math.round(Math.sqrt(number));
    for (int divider = 2; divider <= maxDivider; divider++) {
    	if (number % divider == 0) {
    		return false;
    	}
    }