This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class Math { | |
| public static boolean isPrime(final long number) { | |
| if (number == 2) | |
| return true; | |
| if (number < 2) | |
| return false; | |
| if(number % 2 == 0) | |
| return false; | |
| long maxCheck = (long) Math.sqrt(number); | |
| for (long i = 3; i <= maxCheck; i += 2) { | |
| if (number % i == 0) | |
| return false; | |
| } | |
| return true; | |
| } | |
| } |
Modified the for loop as proposed by Alan (comment #1) which makes the method roughly twice as fast.
