1. The method generatePrimes places the first set of primes in an array. Add the statements to the morePrimes method that fill the remaining locations in the array with the next primes. For each value, divide the value by all of the primes in the array; if the value is not evenly divisible by one of the primes, then that value is a prime and is to be added to the array in the next available location. Do not use any temporary arrays. This question does not require the use of the Sieve of Eratosthenes. The method is to terminate when all of the locations in the array are filled with prime values. Print the values in the array to System.out when the loop terminates.
   
2. 
   
3. 
   
4. import java.util.Arrays;
   
5. 
   
6. public class primeNumber
   
7. {
   
8. public static void main(String[] parms)
   
9. {
   
10. process();
    
11. System.out.println("\nProgram completed normally.");
    
12. }
    
13. 
    
14. public static void process()
    
15. {
    
16. int[] primes;
    
17. int numPrimes;
    
18. 
    
19. primes = new int[25];
    
20. numPrimes = generatePrimes(primes);
    
21. System.out.println(Arrays.toString(primes));
    
22. 
    
23. morePrimes(primes, numPrimes);
    
24. System.out.println(Arrays.toString(primes));
    
25. }
    
26. 
    
27. public static int generatePrimes(int[] primes)
    
28. {
    
29. int[] initialPrimes = new int[]{2, 3, 5, 7, 11, 13, 17};
    
30. int count;
    
31. 
    
32. System.arraycopy(initialPrimes,0,primes,0,initialPrimes.length);
    
33. 
    
34. return initialPrimes.length;
    
35. }
    
36. 
    
37. public static void morePrimes(int[] primes, int numPrimes)
    
38. {
    
39. int count;
    
40. int value;
    
41. boolean done;
    
42. 
    
43. }
    
44. }

复制代码

1. The method generatePrimes places the first set of primes in an array. Add the statements to the morePrimes method that fill the remaining locations in the array with the next primes. For each value, divide the value by all of the primes in the array; if the value is not evenly divisible by one of the primes, then that value is a prime and is to be added to the array in the next available location. Do not use any temporary arrays. This question does not require the use of the Sieve of Eratosthenes. The method is to terminate when all of the locations in the array are filled with prime values. Print the values in the array to System.out when the loop terminates.
   
2. 
   
3. 
   
4. import java.util.Arrays;
   
5. 
   
6. public class primeNumber
   
7. {
   
8. public static void main(String[] parms)
   
9. {
   
10. process();
    
11. System.out.println("\nProgram completed normally.");
    
12. }
    
13. 
    
14. public static void process()
    
15. {
    
16. int[] primes;
    
17. int numPrimes;
    
18. 
    
19. primes = new int[25];
    
20. numPrimes = generatePrimes(primes);
    
21. System.out.println(Arrays.toString(primes));
    
22. 
    
23. morePrimes(primes, numPrimes);
    
24. System.out.println(Arrays.toString(primes));
    
25. }
    
26. 
    
27. public static int generatePrimes(int[] primes)
    
28. {
    
29. int[] initialPrimes = new int[]{2, 3, 5, 7, 11, 13, 17};
    
30. int count;
    
31. 
    
32. System.arraycopy(initialPrimes,0,primes,0,initialPrimes.length);
    
33. 
    
34. return initialPrimes.length;
    
35. }
    
36. 
    
37. public static void morePrimes(int[] primes, int numPrimes)
    
38. {
    
39. int count;
    
40. int value;
    
41. boolean done;
    
42. 
    
43. }
    
44. }

复制代码