Prime Generator

March 12, 2009 at 2:28 pm 1 comment

Now this is more strange for me:

http://www.codechef.com/problems/PRIME1/

Again, I have put in some optimizations, but am unable to meet the time criteria, so my implementation is timing out 😦

Perhaps other guys are using some advanced algorithms to find out a prime number I guess.

Advertisements

Entry filed under: Uncategorized.

Enormous Input Test Over and Under

1 Comment Add your own

  • 1. narinderberi  |  March 12, 2009 at 2:46 pm

    Hmmm…

    I guess I need to switch to some REAL algorithms specifically designed for determining ‘Primality’, as described in:

    This document mentions these primality test algorithms for large numbers:

    AKS Primality test
    Fermat Primality test
    Lucas Lehmer Primality test
    Solovay Strassen Primality test
    Miller Rabin Primality test

    I will check these out and let you know…

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Trackback this post  |  Subscribe to the comments via RSS Feed


Blog Stats

  • 4,036 hits

Recent Comments


%d bloggers like this: