OpenEuphoria

RE: $100 Contest Question

• Posted by bensler at mail.com Mar 05, 2002
• 436 views

I need clarification on this. This is essentially what I asked Rob when 
I asked about predefining a hashtable.

I'm asuming, we cannot asume anything about words.txt except that it 
will be sorted, and all words are capitalized.

Are there other specifications of the file that we CAN count on Rob? 
like number of words, or number of words beginning with each letter. Or 
number of words of each length. What about maximum word length?

Should the routine handle lowercase parameters?


Chris

petelomax at blueyonder.co.uk wrote:
> On Sun, 3 Mar 2002 23:37:20 -0500, Robert Craig
> <rds at RapidEuphoria.com> wrote:
> 
> >but I don't want programs to 
> >take advantage of anything they did in a previous run.)
> 
> Everyone knows that there are 51798 words in the dictionary.
> I've also worked out that one of my arrays will need 122545 entries.
> 
> I assume it is ok to code these constants into the program.
> 
> In contest #2, you specify a library routine. Therefore I expect you
> to invoke my code with
> 
> include myfile
> ...
> select(pattern)
> 
> in a standard test rig rather than the dos prompt redirection thingy.
> Is that right? If not, do you want a library routine and a loading
> program, or do you want them munged into a single standalone program?
> 
> You also specify "a sequence containing all the words". Should this be
> in alphabetical order? I'm going to assume not unless otherwise told.
> 
> Pete Lomax
> 
>