Hello edit the given JAVA code so that it prints the required output when we run it and follows the the pseudo code described. The current issue with the code is that when we run it. It doesn't adds the number N when the input is prime number. Kindly fix this I WILL GIVE UPVOTE *---------------------------------------------------------------------* Question 1. depends on pseudo code described algorithm below find primes up to N in java programming language. For all numbers a: from 2 to sqrt(N) IF a is unmarked THEN a is prime For all multiples of a (a < n) mark them as composite All unmarked numbers are prime Input N: 199 Primes up to 200: 2357 1113 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 Hint: Put 1 to n in a array. Mark composites with 0. *---------------------------------------------------------------------* Required Output: Input N: 199 Primes up to 199: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 *---------------------------------------------------------------------* Code: import java.util.Arrays; import java.util.Scanner; public class Main { public static void printPrime(int N){ Integer [] arrayPrime = new Integer[N] ; Arrays.fill(arrayPrime, 1); for(int i=2; i*i<=N; i++) { if(arrayPrime[i] == 1) { for(int j = i * i;j< N;j+=i) { arrayPrime[j] = 0; } } } System.out.print("Primes up to "+N+": "); for(int i=2;i
Hello edit the given JAVA code so that it prints the required output
when we run it and follows the the pseudo code described.
The current issue with the code is that when we run it. It doesn't
adds the number N when the input is prime number.
Kindly fix this I WILL GIVE UPVOTE
*---------------------------------------------------------------------*
Question 1. depends on pseudo code described
primes up to N in java programming language.
For all numbers a: from 2 to sqrt(N)
IF a is unmarked THEN
a is prime
For all multiples of a (a < n)
mark them as composite
All unmarked numbers are prime
Input N: 199
Primes up to 200: 2357 1113 17 19 23 29 31 37 41 43 47 53 59 61 67 71
73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163
167 173 179 181 191 193 197 199
Hint: Put 1 to n in a array. Mark composites with 0.
*---------------------------------------------------------------------*
Required Output:
Input N: 199
Primes up to 199: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61
67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151
157 163 167 173 179 181 191 193 197 199
*---------------------------------------------------------------------*
Code:
import java.util.Arrays;
import java.util.Scanner;
public class Main
{
public static void printPrime(int N){
Integer [] arrayPrime = new Integer[N] ;
Arrays.fill(arrayPrime, 1);
for(int i=2; i*i<=N; i++)
{
if(arrayPrime[i] == 1)
{
for(int j = i * i;j< N;j+=i)
{
arrayPrime[j] = 0;
}
}
}
System.out.print("Primes up to "+N+": ");
for(int i=2;i<N;i++)
{
if(arrayPrime[i] == 1)
{
System.out.print(i+" ");
}
}
}
public static void main(String[] args)
{
int numberN;
Scanner sc = new Scanner(System.in);
System.out.print("Input N: ");
numberN = sc.nextInt();
printPrime(numberN);
}
}
*---------------------------------------------------------------------*
Step by step
Solved in 2 steps with 1 images
