Answers for "optimal way to find prime numbers"

Whatever

0

optimal way to find prime numbers

int main () 
{
    for (int i=2; i<100; i++) 
        for (int j=2; j*j<=i; j++)
        {
            if (i % j == 0) 
                break;
            else if (j+1 > sqrt(i)) {
                cout << i << " ";

            }

        }   

    return 0;
}

Posted by: Guest on May-07-2021

Source

Code answers related to "optimal way to find prime numbers"

Code answers related to "Whatever"

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#