We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Java
  3. Advanced
  4. Prime Checker
  5. Discussions

Prime Checker

  • vlad_belon + 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;
	}
}