week3 exercise

/**
 * Author:  Bryan Yen(顏慷)
 * Email:   rcd1988715@gmail.com
 * Date:    2017-07-01
 * Description: 埃氏筛法求素数
*/



public class FindPrime{
  public static void main(String args[]){
      char []array = new char[10001];

      for (int i=0; i< array.length;  i++ ){
        array[i]='Y';
        //System.out.println(i+ "," + array[i]);

      }

      for(int i=2 ; i<=10000; i++){
        if(array[i] == 'Y'){
            for(int j=i; j*i <=10000; j++){
              array[i*j]= 'N';

            }
        }

       //System.out.print(i+":"+array[i]+",");

      }



      for (int i=2;i<=10000; i++)
      {
        if(array[i]=='Y'){
          System.out.print(i+" ");
        }
      }

       for (int i : array){
        if(array[i]=='Y'){
          System.out.print(i+":"+array[i]+",");
        }
      }





      }


  }

Last updated

Was this helpful?