OpenEuphoria

Re: $100 Contest Question

• Posted by rforno at tutopia.com Mar 04, 2002
• 452 views

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.


----- Original Message -----
From: "Derek Parnell" <ddparnell at bigpond.com>
To: "EUforum" <EUforum at topica.com>
Subject: Re: $100 Contest Question


>
> Hi Chris,
> I'm now so here is the details I promised.
>
> >
> > What kind of bench test are you using Derek? I get nowhere near those
> > kinds of results.
>
> This is the group of 16 tests I repeat 80 times.
>
>     Test({1,1,2,3,4})
>     Test({'E', 1, 2, 3, 1, 3})
>     Test({})
>     Test({1,1})
>     Test({1})
>     Test({1,2,3})
>     Test({4,'i','e'})
>     Test({1,'E',2, 'E', 3, 'e'})
>     Test({"ABC"&'\'','s'})
>     Test("rabbit")
>     Test("r" & {1,1,2})
>     Test({'t',1,2})
>     Test({1,2,3,'s'})
>     Test({1,1,2,2})
>     Test({1,2,2,1})
>     Test({1,2,3,4,'e','d'})
>
>
> > I use..
> >   match_pattern({1,2,3,1,4,3,3,2,5,3}) -- ZIGZAGGING
> > ..in an iterated loop
> >
> > I don't think I can even iterate 50x in 1.48 seconds
> > And that pattern is on the faster side of the avergage.
> >
> > I don't understand how you could possibly get it that fast, unless your
> > pattern is {1}, only then is my program comparable to your results.
> >
> > I've still got some tweaking to do, but I don't see it getting much
> > faster.
> >
> > Try...
> > -- find all 7 letter words with unique letters
> > match_pattern({1,2,3,4,5,6,7})
> >
> > I'd like to know what your iteration time is for that one.
>
> This takes between 0.99 and 1.04 seconds to do 10,000 iterations.
>
>   sequence VOID
>   atom ts
>   ts=time()
>   for i = 1 to 10000 do
>     Test({1,2,3,4,5,6,7})
>   end for
>   printf(1, "%f\n", time()-ts)
>
>
> For the ZIGZAGGING test, it takes between 2.97 and 3.04 seconds to do
10,000
> iterations.
>
>
> Thanks for getting me to do this test 'cos I can see a further
optimisation
> now 
>
> ----------
> cheers,
> Derek
>
>
>
>