OpenEuphoria

RE: $100 Contest Question

• Posted by bensler at mail.com Mar 04, 2002
• 555 views

On my PIII 600mhz/64MB :

  Euman's hashtable runs at 0.8s

With FULL inclusion of my program in the bench time:

  My results for Derek's benchtest are:
    Load time    :  0.16
    Total time   :  8.79
    Iterated time:  0.006867

  My results for this benchtest(x100 iterations) are:
    Load time    :  0.16
    Total time   : 15.36
    Iterated time:  0.011

My program isn't valid for submission though, because it uses a 
predefined hashtable.

Derek still has me beat by a long shot.

I definitely need to revamp my algorithm :/


Chris


Martin Stachon wrote:
> From: <bensler at mail.com>
> > Can someone give me a benchmark for problme#2?
> > 
> > Total run time, number of iterations, and the filter/s used
> > I need to know if I'm in the ball park, or if I need to reconsider my 
> > implementation.
> 
> Using this benchmark :
>         {
>             {1,2,3,4,5,4,3,2,1},
>             {1,2,'X'},
>             {'M',1,2,3,4,5},
>             {1,2,3,4,5,6,7,8,9,10},
>             {'E',1,1,2},
>             {1,2,2,1,3},
>             {1,1,2},
>             {1,2,1},
>             {'M',1,2,1,'M'},
>             "MARTIN",
>             {1,2,'X',2,1},
>             {1,2,3,'B',3,4},
>             {1,2,'M',2,1},
>             {'E',1,2,3,1,3}
>         }
>     for p=1 to length(pats) do
>         words = get_words_by_pattern(pats[p])
>     end for
>     ? time()-t
> On my Winchip @200Mhz, Win98. And you?
> 
>     Martin
> 
>