Printable View
my code::
can anyone suggest how to make the output larger?????
Code:
#include<stdio.h>
#include<limits.h>
#include<float.h>
int main()
{
unsigned int num,tmp,suc=1,i;
num=UINT_MAX;
do
{
suc=1;
tmp=num;
for(i=2;i<=tmp/2;i++)
{
if(tmp%i==0)
{
suc=0;
break;
}
}
num--;
}while(suc==0);
printf("%u",num+1);
getchar();
return 0;
}
what do you mean by lager?
larger means the biggest prime number possible
you can try
unsigned long
unsigned long long (not supported by all compilers)
some library for working with extreamly long numbers
http://www.prime-number.orgQuote:
Originally Posted by ElemenT.usha
"the biggest prime number possible" means nothing. There is no limit beyond which all numbers are composite. The only possible thing you can mean is the largest prime number known to man.
You don't have a hope of getting anywhere remotely near the largest primes known to man using such an archaic and naieve algorithm. It would literally take Millennias (thousands of years)! No I'm not exagerating.
Hell, I've written a decent bigint library, but even I gave up hope of doing realistically useful primality testing.
Even getting into the upper realms of 64-bit territory just gets ridiculous with how long it takes using the algorithm you provided. Faster algorithms like your typical sieve of Eratostheses overflow conventional PC memory with this size too.
I'm sorry, but unless you use a special purpose library, you simply wont be able to do what you want!
You could try understanding the Primality testing algorithms in Wikipedia, but be warned, you'd best become a maths professor first.
actually i need to use a time function and find the largest possible in 2sec..
so can you tell me some means to speed up my process
It could be possible for 64 bits but only with very advanced methods.
As iMalc pointed out, do a little Wiki study, try implementing the suggested methods.
It might turn out to be a difficult task, and you probably need to know good 'C' to get it to work and be correct also, even for someone who knows good 'C'.
Well, how about telling us that to being with?Quote:
Originally Posted by ElemenT.usha
So, how does that work? You need to explain furthur. Do you just start writing out primes, and after 2 seconds your program is killed off and the highest prime you outputted during that time is the winner?
You can get some improvement by storing a list of primes as you go, and testing against primes in the list that are less than the square root of the number, instead of testing all odd numbers.
Note that this is still significantly slower than the Sieve of Eratostheses, but past a certain point it requires less extra memory. I'm not going to help much beyond that because this is obviously a test of some kind.