Algorithms_First15PrimeNumber

public class First15PrimeNumber {

    public static void main(String[] agrs) {
        int flag = 0;
        Scanner sc = new Scanner(System.in);
        System.out.println("Frist 15 Prime Number");
        for (int i = 1; i < 50; i++) {
            if (isPrimeNumber(i)) {
                System.out.print(i + " ");
                flag++;
            }
        }
    }

    public static boolean isPrimeNumber(int n) {
        int flag = 0;
        for (int i = 1; i <= n; i++) {
            if (n % i == 0) {
                flag++;
            }
        }
        if (flag == 2) {
            return true;
        }
        return false;
    }

}