gnieark/Euler
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

dont calcluate sqrt each time

Browse Source
This commit is contained in:
gnieark 2015-11-24 22:39:49 +01:00
parent e653def175
commit c020da2c76
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
libc/getPrimeNumber.c
View File

@ -11,14 +11,15 @@ int main(int argc, char *argv[])
else{ else{
int limit= atoi(argv[1]); int limit= atoi(argv[1]);
int *primes, i, isPrime,count=2, number=3; int *primes, i, isPrime,count=2, number=3,root;
primes=(int*)malloc(limit*sizeof(int)); primes=(int*)malloc(limit*sizeof(int));
primes[0]=2; primes[0]=2;
primes[1]=3; primes[1]=3;
while( count <= limit){ while( count <= limit){
isPrime=1; isPrime=1;
for (i=0; ((primes[i] <= sqrt(number)) && (i < count)) ; i=i+1){ root=sqrt(number);
for (i=0; ((primes[i] <= root) && (i < count)) ; i++){
if(number%primes[i] == 0){ if(number%primes[i] == 0){
isPrime=0; isPrime=0;
break; break;