How to resolve the algorithm Sieve of Eratosthenes step by step in the SAS programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Sieve of Eratosthenes step by step in the SAS programming language

Table of Contents

Problem Statement

The Sieve of Eratosthenes is a simple algorithm that finds the prime numbers up to a given integer.

Implement the   Sieve of Eratosthenes   algorithm, with the only allowed optimization that the outer loop can stop at the square root of the limit, and the inner loop may start at the square of the prime just found. That means especially that you shouldn't optimize by using pre-computed wheels, i.e. don't assume you need only to cross out odd numbers (wheel based on 2), numbers equal to 1 or 5 modulo 6 (wheel based on 2 and 3), or similar wheels based on low primes. If there's an easy way to add such a wheel based optimization, implement it as an alternative version.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Sieve of Eratosthenes step by step in the SAS programming language

Source code in the sas programming language

proc iml;
start sieve(n);
    a = J(n,1);
    a[1] = 0;
    do i = 1 to n;
        if a[i] then do;
            if i*i>n then return(a);
            a[i*(i:int(n/i))] = 0;
        end;
    end;
finish;

a = loc(sieve(1000))`;
create primes from a;
append from a;
close primes;
quit;

  

You may also check:How to resolve the algorithm Elementary cellular automaton step by step in the Go programming language
You may also check:How to resolve the algorithm Greatest element of a list step by step in the PowerShell programming language
You may also check:How to resolve the algorithm Draw a pixel step by step in the EasyLang programming language
You may also check:How to resolve the algorithm Loops/N plus one half step by step in the Lhogho programming language
You may also check:How to resolve the algorithm Metaprogramming step by step in the Standard ML programming language