d8c81b172b
Print some fun information at the end.
2016-12-14 15:29:06 +01:00
5bbac132bc
Use size_t, which is better for arrays of very large sizes.
2016-12-14 14:13:32 +01:00
2a3e97f4bc
Prepare version number so I don't forget later.
2016-12-13 18:09:05 +01:00
06d5ddb0cc
Fixed problem with the algorithm.
...
If it's equal to half then we want to check if it's divisible, since if
it's half then it is NOT prime.
2016-12-13 18:05:02 +01:00
5aa0b333c0
Made a fix, because previously it was not measuring primes.
2016-12-13 16:32:10 +01:00
2e9326b5fb
Preparing for v0.4
...
I'm going to be learning OpenCL, after which I will decide whether to
use OpenCL or OpenMP for the development of Indivisible. This mostly
depends on the compatibility of each library with GMP, especially since
I believe GMP already does some of its own threading.
2016-12-12 23:21:22 +01:00
06cb271dba
Forgot to set that shit to v0.3
2016-12-12 16:20:21 +01:00
dab78093ab
Deleted macros
2016-12-10 17:11:21 +01:00
f4ee9872bc
Optimize the algorithm to avoid numbers larger than half.
2016-12-10 14:46:51 +01:00
dd38b53e31
Fixed leaks.
2016-12-10 11:20:01 +01:00
3c8b9922fb
Shorten the long ass `unsigned long long int' to ulli.
2016-12-10 02:20:57 +01:00
cb9e1648e9
No need to use that macro outside a loop.
2016-12-10 02:09:34 +01:00
30703314dd
Forgot it for the main loop as well.
2016-12-10 01:15:52 +01:00
4905391c82
Add more optimizations.
2016-12-10 00:50:23 +01:00
79a9ba11ff
Switch to C, stop using OpenMP, start using GMP.
2016-12-09 23:02:51 +01:00
