BitSensei

programmer knowledge

  • Increase font size
  • Default font size
  • Decrease font size
Home Algorithms
Algorithms

Fast Approximations for pow(), exp() and ln()

Thursday, 14 May 2009 14:45 Brett Hutley
E-mail Print PDF

Martin Ankerl has put up an interesting description here on some fast approximations for pow(), exp() and ln().

 

Cuckoo Hashing

Thursday, 14 May 2009 14:07 Brett Hutley
E-mail Print PDF

There is a good introduction here (downloadable PDF) on Cuckoo Hashing. The basic idea behind Cuckoo Hashing is that you use two hashing algorithms instead of one. If both possible hash locations already have occupants, one of the tenants is thrown out, and sent packing to it's alternative hash location. This process is repeated until all the keys are safely housed.