RE: $100 Contest Question

new topic     » goto parent     » topic index » view thread      » older message » newer message

As a real world practicality, I think that lowercase should be included. 
By splitting the ascii pattern at 32, it leaves no input error cases.

BTW Derek:

  I've got your benchmark down to 0.00305 :) And it's tested for 
correctness.

  I'm sure I can knock that down some too.


Chris


Derek Parnell wrote:
> 5/03/2002 7:43:18 AM, rforno at tutopia.com wrote:
> 
> >
> >Derek:
> >It seems to me I don't understand the rules. Being that Junko's 
> >words.txt
> >contains only upper case, what is the point of:
> >Test({1,2,3,4,'e','d'})  ?
> >Thanks.
> >
> >
> Strictly you're correct. If we read the rules it does imply that the 
> pattern is case sensitive. 
> 
> "Assume that the numbers 0 to 32 are used to indicate the pattern, while 
> the numbers above 32 are 
> the ASCII codes of literal characters to be matched (including 
> apostrophe and hyphen)."
> 
> And thus applying lowercase characters in the pattern to WORDS.TXT would 
> be a waste of time.
> 
> Because the other competition's stressed case-insensitivity, I assumed 
> it would apply to this comp 
> as well. Thank's for pointing out my error.
> 
> ---------
> Derek.
> 
>

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu