This site took too long to answer. You can still read it on the original site — the toolbar below keeps your place in the directory.
After I read a small paper named How to make Lisp go faster than C I decided to do some small benchmarking myself with C++ and Common Lisp. For benchmarking I have written programs which find prime numbers from 2 up to 384460. All programs were run on my laptop with the following specs and properties: C++ bool isprime ( unsigned long n) { if (n < 2 ) return false; for ( unsigned long i = 2 ; i <…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.