You are viewing a single comment's thread. Return to all comments →
Can you explain me why you check all odd numbers until square root of n? I don't understand why square root and not n/2..
Anyway this is my working solution:
private boolean isPrime(int n) { if (n < 2) { return false; } for (int i = 2; i <= n / 2; i++) { if (n % i == 0) { return false; } } return true; }
Seems like cookies are disabled on this browser, please enable them to open this website
Prime Checker
You are viewing a single comment's thread. Return to all comments →
Can you explain me why you check all odd numbers until square root of n? I don't understand why square root and not n/2..
Anyway this is my working solution: