Eratosthenes 筛选法 c语言 数组+指针实现

#include<stdlib.h>
#include<stdio.h>

#define SIZE 1000
#define TRUE 1
#define FALSE 0
int main()
{
    char sieve[ SIZE ];
    char *sp;
    int number;
    /*
     Set the entire sieve to TRUE
     */
    for( sp = sieve; sp < &sieve[ SIZE ]; )
        *sp++ = TRUE;

    /*
    process each number from 3 to as many as the sieve holds
    */
    for( number =3; ;number +=2 ){
        sp = &sieve[ 0 ] + ( number -3 )/2;
        if( sp >= &sieve[ SIZE ] )
            break;
    /*
     Now advance the pointer by multiples of the number and set each subsequent entry FALSE.
     */
        while( sp += number, sp < &sieve[ SIZE ] )
            *sp = FALSE;
    }

    /* Go through the entire sieve now and print the numbers corresponding to the locations that remain TRUE */
    printf( "2/n" );
    for( number =3,sp = &sieve[ 0 ];sp < &sieve[ SIZE ]; number += 2 ,sp++ ){
        if( *sp )
            printf( "%d/n",number );
    }
    return EXIT_SUCCESS;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值