Primes

From Mindstab Wiki

News (http://www.mindstab.net/wordpress/archives/category/primes/)


The primes project is a project to write prime number finders in as many languages as I can get ahold of.

There are two clear rational behind this project:

  • The project offered a clear and simple way to get myself introduced to as many languages as I could find. It gave me a vauge idea of what each language was about and a handy reference source file to look up at a later date.
  • Since the program performs raw computations, I now also had a collection of similar programs that I could use to roughly benchmark the speeds of each language at simple math. Crude but handy.

The following languages have currently been implemented (in no particular order):

  1. C
  2. C++
  3. PERL
  4. PHP
  5. Python
  6. Awk
  7. Java
  8. C#
  9. Ada
  10. TCL

  1. Objective C
  2. Assembly (x86)
  3. VisualBasic .NET
  4. Cobol
  5. Fortran
  6. JavaScript *
  7. Unix Shell
  8. Pascal
  9. Modula-3
  10. Smalltalk

  1. Ruby
  2. Lisp
  3. Scheme
  4. ML
  5. OCaml
  6. Haskel
  7. Eiffel
  8. Fourth
  9. Erlang
  10. Ferite

  1. Prolog
  2. Pike
  3. Lua
  4. REXX
  5. REBOL
  6. Nickle
  7. M4

A running and timing utility (autotest.pl) is included for automation purposes.

The latest version is 1.1 and can be downloaded from:

ftp.mindstab.net/primes/primes-1.1.tar.gz [ http (http://ftp.mindstab.net/primes/primes-1.1.tar.gz) ] [ ftp (ftp://ftp.mindstab.net/primes/primes-1.1.tar.gz) ] or from git 

git clone git://git.mindstab.net/git/primes
Retrieved from "http://mindstab.net/wiki/index.php/Primes"