OpenEuphoria

Re: $100 Contest Question

• Posted by euman at bellsouth.net Mar 03, 2002
• 495 views

Kat did you try my posted routine yet?

This builds a alphabetical 'A' to 'Z' sequence
that allows for text length upto 26 letters

example

"A," -- length (1)
"AD,AH,AL,AM,AN,AS,AT,AU,AW,AX,AY," -- length (2)
"ABC,ABE,ABO,ACE,ACT,ADA,ADD,ADO,ADS,ADZ,AFT,AGE, etc..etc" -- length (3)
"ABBA,ABBE,ABBY,ABED,ABEL,ABET,ABLE,ABLY,ABUT,ACES,ACHE,ACID, etc...etc" --
length (4)

down to length (26)
then starts over with the next beginning letter (B,C,D out to Z)

3.5 sec on my 233mhz but instead of the text I presented it will be UNIQUE
numerical values
that represent the text.

Later,

Euman
euman at bellsouth.net

Q: Are we monetarily insane?
A: YES
----- Original Message ----- 
From: "Kat" <gertie at PELL.NET>
To: "EUforum" <EUforum at topica.com>
Sent: Sunday, March 03, 2002 8:02 PM
Subject: Re: $100 Contest Question


> 
> On 4 Mar 2002, at 10:20, Derek Parnell wrote:
> 
> > 
> > ----- Original Message -----
> > From: "Ray Smith" <smithr at ix.net.au>
> > To: "EUforum" <EUforum at topica.com>
> > Sent: Monday, March 04, 2002 9:47 AM
> > Subject: RE: $100 Contest Question
> > 
> > 
> > > My PC at work (PIII 650 Windows 2000 Professional) does this
> > > in 2.36 seconds (for a 4,121,548 bytes sized file)
> > >
> > 
> > Okay, so I took the bait. I've now got it down from 4.33 seconds to 1.7
> > seconds for that 4,267,462 byte file.
> 
> Ok, i bow out of the contest. It takes me 434 seconds (over 7 minutes) just 
> to load a dictionary into memory. Building the dictionary from 3 files takes
> 72
> minutes. I took the premunge time to sort words by length, and i load only 
> words corresponding in length to words present in the cyphered line. You are 
> getting times 10x to 140x faster than i am. I concede.
> 
> Kat
> 
> 
> 
>