CareerCup

Use "Sieve of Eratosthenes" for actual count.

Approximately (A/ ln A) - (B/ ln B), using prime number theorem.

Make typical prime generator function but in its inputs, have A and B where the function only tests numbers in that range and returns the count of the result

int getPrime(int a, int b)
    {
        int count = 0;
        for ( int i = a; i <=b ; ++i )
        {
            if ( isPrime(i))
            {
                System.out.println("Prime Number: " + i);
                count ++;
            }      
        }
        
        return count;
    }
    boolean isPrime( int a)
    {
        boolean bIsPrime = true;
        if ( a == 1 ) return false;
        if ( a <= 3) return bIsPrime;
        int sqrt  =  (int) Math.sqrt((double)a);
        for (int i = 2; i <= sqrt; ++i)
        {
            if ( (a % i ) == 0 )
            {
                bIsPrime = false;
                break;
            }
        }
        return bIsPrime;
    } // End isprime()