Java Print Prime number (prime number)

Source: Internet
Author: User

Requirements: Prints the prime and non-prime numbers in 2-100000. (Prime definition: in a natural number greater than 1, there are no other factors other than 1 and itself)

1. Conventional way--for positive integer n, if all integers from 2 to zero are not divisible, then n is prime:

  //sqrt Method   Public Static voidPrintPrime1 (intnum) {    Boolean[] Isprimes =New Boolean[num + 1];  for(inti = 2; i < isprimes.length; i++) {Isprimes[i]=true; }     for(inti = 3; I <= num; i++) {       for(intj = 2; J <= Math.sqrt (i); J + +) {        if(i% j = 0) {Isprimes[i]=false;  Break; }}} System.out.print ("Prime numbers are:");  for(inti = 2; i < isprimes.length; i++) {      if(Isprimes[i]) {System.out.print (i+ " "); }} System.out.println (""); System.out.print ("Non-prime numbers are:");  for(inti = 2; i < isprimes.length; i++) {      if(!Isprimes[i]) {System.out.print (i+ " "); }    }  }

Note that the use of a Boolean array for the determination of the prime number and the final result of the printing, avoid using two containers to separate each of the two pieces of content to be printed.

2. The Screening method

  //wagered Sieve Method   Public Static voidPrintPrime2 (intnum) {    Boolean[] Isprimes =New Boolean[num + 1];  for(inti = 2; i < isprimes.length; i++) {Isprimes[i]=true; }     for(inti = 2; i < num; i++) {      if(Isprimes[i] = =true) {         for(intj = 2; I * j <= num; J + +) {isprimes[i* j] =false; }}} System.out.print ("Prime numbers are:");  for(inti = 2; i < isprimes.length; i++) {      if(Isprimes[i]) {System.out.print (i+ " "); }} System.out.println (""); System.out.print ("Non-prime numbers are:");  for(inti = 2; i < isprimes.length; i++) {      if(!Isprimes[i]) {System.out.print (i+ " "); }    }  }

Finally, a main method is provided to complete the invocation and performance comparison of two methods:

   Public Static voidMain (string[] args) {LongTimePoint1 =System.currenttimemillis (); PrintPrime1 (100000); LongTimePoint2 =System.currenttimemillis ();    System.out.println (); PrintPrime2 (100000); LongTimePoint3 =System.currenttimemillis ();    System.out.println (); System.out.println ("Sqrt Method Time:" + string.valueof (timepoint2-timepoint1));//390 MsSystem.out.println ("The time spent on the screen:" + string.valueof (Timepoint3-timepoint2));//297 Ms}

Java Print Prime number (prime number)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.