设计程序找出1~100 间的质数，显示出来。用for 或while 或do-while
循环语句实现。

#include<iostream>
#define maxn  1000000
using namespace std;
int n,prime[maxn]={1,1,0},prime1[maxn],count=0;
void is_prime()
{
    for(int i=2;i<=n;i++)
    {
        if(prime[i])
        continue;
        prime1[count++]=i;
        for(int j=i*2;j<=n;j+=i)
        {
            prime[j]=1;
        }
    }
}
int main()
{
    cin>>n;
     is_prime();
     for(int i=0;i<count;i++)
     {
         cout<<prime1[i]<<" ";
     }
     cout<<endl;
     return 0;
}
时间复杂度无限接近o(n)

#include <iostream>

bool zhi(int shu);

int main()
{
    bool p = false;
   
    for (int i =  2; i <= 100; i++)
    {
        p = zhi(i);
        if (p)
        {
            std::cout << i << "\t";
        }

    }
    return 0;
}
bool zhi(int shu)
{
    int tu = 2;
    while (tu < shu)
    {
        if (shu % tu == 0)
        {
            return false;
        }
        tu++;
    }  
    return true;

     
}