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.
  1. Practice
  2. Java
  3. Advanced
  4. Prime Checker
  5. Discussions

Prime Checker

  • lin1000 + 2 comments

    Hi, do you think this version will be faster? wanna hear your thought.

    class Prime {
    void checkPrime(int... numbers) {
        for (int num : numbers) {
            if (isPrime(num)) {
                System.out.print(num + " ");
            }
        }
        System.out.println();
    }
    
    boolean isPrime(int n) {
        if (n < 2) {
            return false;
        }
        for (int i = 2; i <= (int) Math.sqrt(n) && isPrime(i); i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }     
}

    • RodneyShag + 0 comments

      That will be slower. The extra isPrime() check is much slower then the 3 lines of code in the for loop in isPrime(). You can actually test out both versions and see the execution times in your submissions.

      HackerRank solutions.

    • keerthikumar_n + 0 comments

      Yes.. the basic thing is you have reduced the no. of loops :)