OpenEuphoria

Re: Hash Function

• Posted by Jason Gade <jaygade at yahoo.com> Nov 11, 2004
• 490 views

Alexander Toresson wrote:
> cklester wrote:
> > Unfortunately, I think the contest is just going to be who can write the
> > fastest hash algorithm... something with which I have limited experience,
> > and fortunately wasn't a factor in the first official contest. :)
> > 
> 
> I'll share mine with you when the contest is over. It's fast and near-
> optimal.
> 
> However, I don't think that the contest is only about hashes - mine uses
> 14% of the total runtime.
> 
> Regards, Alexander Toresson
> 
> Shhh! Be vewy quiet! I'm hunting wuntime ewwows!
> 

Yes, I will be very interested to see some of the winning results.  I can't
profile my code
because I'm not registered, so I don't know what my bottlenecks are.

Right now, though, I'm working on correctness more than anything.

After that, my biggest challenge has been figuring out how to (quickly) make a
list of words
sorted by frequency.


------------------------------------
Too many freaks, not enough circuses.
j.