[oclug] Programming Wars 2.0 - September 2001

[Vic Gedris]

On Fri, 3 Aug 2001 cbbrowne at ntlug.org wrote:

> This ought not to be a _serious_ constraint, save for the "shortest program"
> criteria.  [And when you go there, adding in a list of primes likely does
> _NOT_ help make the program shorter...]

When I post my next Pwars update, I'll make sure I stress the issue.

> A thought:  Supposing you want a set of prime "seeds" that might be, let's
> say, the first ten, then you use [some scheme that refers only to 1, 2, and
> perhaps the number 10], to generate that small list.  It may not run with all
> the efficiency you hoped for, but _that's life._
> You then have a list of 10 primes with which you can then use your funky
> algorithms that want a "seed."

Like I said before, I don't think it should be a big problem generating
a seed within the program.  Or am I completely wrong and this can't be
done without a seed?

-Vic

-- 
------------------------------------------------------------------------
    WORLD WIDE PUNK        http://www.worldwidepunk.com
vic-at-worldwidepunk.com   PO Box 52051, Ottawa Ontario, K1N 5S0, CANADA
------------------------------------------------------------------------