Prime Numbers Algorithm in Java Array

Code

1 package primenumber;
 2 
 3 import java.util.Arrays;
 4 
 5 public class PrimeNumber {
 6     public static int[] generate(int num)
 7     {
 8         int[] numbers=new int[num];
 9         if(num>1){
10             numbers[0]=1;
11         }
12         int i=1,n=2;
13         while(i<num){
14             boolean found=false;
15             for(int j=2;j<n;j++){
16                 if((n%j)==0){
17                     found=true;
18                     break;
19                 }
20             }
21             if(!found){
22                 numbers[i]=n;
23                 i++;
24             }
25             n++;
26         }
27         return numbers;
28     }
29     
30     public static void main(String[] args) {
31         int num=20; //numbers of prime number
32         int[] prime=PrimeNumber.generate(20);
33         System.out.println(Arrays.toString(prime));
34     }
35 }

Output:

run:
[1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67]
BUILD SUCCESSFUL (total time: 0 seconds)

Video Tutorial


Comments



Popular posts from this blog

Simple Java Code HTML Highlighter

How to Use Extends and Implements

Fibonacci Algorithm in Java Array