Find the highest prime number up to the number.
public class HighestPrime {
public static int HighestPrime(int number) {
int value = 1;
if (number <= 2)
return 1;
for (int i = 2; i <= number; i++) {
if (i == number) {
value = number;
break;
}
if (number % i == 0) {
i = 2;
number--;
}
}
return value;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(HighestPrime(20));
}
}
Input: 20
Output: 19 [highest prime number below 20]
Solution:
public class HighestPrime {
public static int HighestPrime(int number) {
int value = 1;
if (number <= 2)
return 1;
for (int i = 2; i <= number; i++) {
if (i == number) {
value = number;
break;
}
if (number % i == 0) {
i = 2;
number--;
}
}
return value;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(HighestPrime(20));
}
}