Changes in grunt, to be more regexpy

I have tried to use regexp as much as I could for this impl. The
implemenation is not so fast as one could imagine, but is not so bad
either (better than the trial division version, aka, primo.pl).
In my macbook pro, i7, takes 232172.000 msec.
Add a first version of a simple implementation of Erasthostenes sieve in perl.

I'm liking it.
Fix. Iteration to print (and mark) went up to $LASTPRIME - 1.
paladin is ready for the fight!

It can solve the problem in 15.589 secs.
Some tweaks to make grunt faster.

The big hard part for the algorithm is the sieving with the regexp I'm
using ... about printing is behaving pretty much ok, so I can't complain
about it, still I couldn't put the times below the minute.

In average, this is the time I get: 1' 42.001''
Some tweaks to make paladin faster.

Applied some of the ideas used in grunt to make this a bit faster.
Without it the program will complete in around 20 ses.
With the tweaks, it can do it in 16.6s aprox.
New generator, sundaram

This program uses sundaram sieve, to calculate the first 2000000
primes.
heisenberg: using a bigger buffer, makes things simpler, and is faster.
Add rule to build sundaram in the makefile. Fix a little bug

I introduced a little mistake while playing with the algorithm limits. I
commited it by mistake, and I'm fixing it with this commit
Add version of sundaram with some threads.
Add a benchmark rule in the makefile
Nicing the call to benchmark
Merge branch 'master' of https://github.com/darkturo/primo

Conflicts:
	c++/heisenberg.cc

Also fix a problem with the Makefile