用低时间复杂度在java中寻找第n个素数

public class PrimeNumberFinder {
    public static boolean isPrime(int num) {
        if (num < 2) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static int findNthPrime(int n) {
        int count = 0;
        int num = 2;
        while (count < n) {
            if (isPrime(num)) {
                count++;
            }
            if (count == n) {
                return num;
            }
            num++;
        }
        return -1; // 如果找不到第n个素数，返回-1或者抛出异常
    }

    public static void main(String[] args) {
        int n = 10; // 要寻找的第n个素数
        int nthPrime = findNthPrime(n);
        System.out.println("第" + n + "个素数是：" + nthPrime);
    }
}