Eratosthenes' Sieve
Author: hidekichi45Executions: 1551
※ This library was created by a member. This site is not responsible for its content.
Sieve of Eratosthenes Last updated February 22, 2022
This program lists all prime numbers less than or equal to a specified natural number. Since there is a timeout limit of one minute, the maximum size that can be specified for the sieve appears to be around 200,000.
To run the Sieve of Eratosthenes, you need to allocate memory. To extract large prime numbers, you must allocate an array up to the value of that prime number to serve as the Sieve of Eratosthenes. While it is possible to split the sieve, whether there is room for improvement will depend on the performance capabilities of the calculation program provided by Casio.The 1-minute timeout limit is significant, and since this program’s performance threshold is set too low, it’s safe to say that the performance of Casio’s calculation program function is by no means high; therefore, even if improvements were made, it is unlikely that significant results would be achieved.
I have also created an executable program that performs only memory allocation, so please refer to that as well.
I have also created an executable program that performs only memory allocation, so please refer to that as well.
No customer feedback for this calculation yet.