Technical Interview (Programs)
24
Prime number logic public boolean isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i < Math.sqrt(n); i++) { if (n % i == 0) { return false; } } return true; } import java.util.Scanner; public class PrimeNumbers { public static void main(String[] args) { Scanner s = new Scanner(System.in); System.out.print("Enter a number : "); int n = s.nextInt(); if (isPrime(n)) { System.out.println(n + " is a prime number"); } else { System.out.println(n + " is not a prime number"); } } public static boolean isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i < Math.sqrt(n); i++) { if (n % i == 0) { return false; } } return true;
-
Upload
swati-gandhi -
Category
Documents
-
view
15 -
download
0
description
it interview question for frehser
Transcript of Technical Interview (Programs)
Prime number logic
public boolean isPrime(int n) { if (n >> c program to implement queue operations
