Re: Benchmarking

2002-05-06 Thread Harley J Pig
On Monday 06 May 2002 02:15 pm, Mtv Europe wrote: > It's to the other department - "Kwalitee Ashuranse" (C) Michael G Schwern :> > Extremal criterias are more interesting, for example as we can see now > André Savigne submit artistic 4847.01 with minimal possible tiebreaker. > On the other hand

Re: Benchmarking

2002-05-06 Thread Harley J Pig
On Monday 06 May 2002 02:19 pm, Eugene van der Pijll wrote: > We had to measure the memory usage of some of the solutions. One of the > Cantors came awfully close to the stated available 2**32 bytes of > memory. Kewl. That must of been a fun one! > > Miksch's Law: > > If a string has one en

Re: Benchmarking

2002-05-06 Thread Eugene van der Pijll
En op 06 mei 2002 sprak Harley J Pig: > I don't know if anyone's brought this up before (where are the archives?) but > has anyone thought to benchmark these solutions? > > I'm curious as to which solution is actually faster|st. Hmmm, how about > memory footprints as well? We had to measure t

Re: Benchmarking

2002-05-06 Thread Mtv Europe
Hello Harley! [EMAIL PROTECTED] (Harley J Pig) wrote: > I don't know if anyone's brought this up before (where are the archives?) > but has anyone thought to benchmark these solutions? > I'm curious as to which solution is actually faster|st. Hmmm, how about > memory footprints as well? It's t

Benchmarking

2002-05-06 Thread Harley J Pig
I don't know if anyone's brought this up before (where are the archives?) but has anyone thought to benchmark these solutions? I'm curious as to which solution is actually faster|st. Hmmm, how about memory footprints as well? Just being curious. Alan -- Miksch's Law: If a string has