public class Exercise10_06 {
public static void main(String[] args) {
final int LIMIT = 120;
int count = 0;
StackOfIntegers stack = new StackOfIntegers();
// Repeatedly find prime numbers
for (int number = 2; number < LIMIT; number++)
if (isPrime(number)) {
stack.push(number);
count++; // Increase the prime number count
}
// Print the first 30 prime numbers in decreasing order
System.out.println("The prime numbers less than 120 are \n");
final int NUMBER_PER_LINE = 10;
while (!stack.empty()) {
System.out.print(stack.pop() + " ");
if (stack.getSize() % NUMBER_PER_LINE == 0)
System.out.println(); // advance to the new line
}
}
public static boolean isPrime(int number) {
// Assume the number is prime
boolean isPrime = true;
// Exercise03_21 if number is prime
for (int divisor = 2; divisor <= number / 2; divisor++) {
//If true, the number is not prime
if (number % divisor == 0) {
// Set isPrime to false, if the number is not prime
isPrime = false;
break; // Exit the for loop
}
}
return isPrime;
}
}
JAVA程序设计第十章10_6
最新推荐文章于 2024-06-26 18:33:25 发布