Output Nth Prime

Output Nth Prime

 Public classfindnthprime{ Public Static voidMain (string[] args) {intN = Integer.parseint (Args[0]);//requires output of nth prime number        int[] Primesvector =New int[N];//stores the number of primes that have been foundPrimesvector[0] = 2;//The first prime number is 2 .        intCntprime = 1;//The number of primes currently found is 1         for(inti = 3; Cntprime < N; i++)        {            BooleanIsPrime =true; //because a non-prime number can be split into a product of prime numbers, it is only necessary to consider the number of primes that have been found             for(intj = 0; J < Cntprime && Primesvector[j]*primesvector[j] <= i; J + +)             {                if(i% primesvector[j] = = 0) {IsPrime=false;  Break;//Jump out of the loop                }            }            if(isprime) {cntprime++; Primesvector[cntprime-1] =i; }} System.out.println ("the" + N + "th prime is" + primesvector[n-1]); }}

Test results

Output Nth Prime