Slashdot Mirror

← Back to Stories (view on slashdot.org)

Probing Hash Tables?

Posted by Cliff on from the interesting-thought-excercises dept.

David Rusenko asks: "I've been taking a datastructures class at CMU as part of a summer CS program. One of these structures we have gone over is hash tables. After going through many different probing methods (linear, quadratic), multiple hash functions, and double hashing, I was all too curious to know if these are the best methods currently known. Some other interesting ideas came up, such as using the Fibonacci numbers for probing, but I haven't had time to test them yet. Any comments?"

2 of 48 comments (clear)

  1. Probing Hash Tables? by jafuser · · Score: 2, Funny
    Probing Jennifer's hash table was a smooth and efficient process, as we together established a very efficient insertion/removal pattern.

    Ok, am I the only person who saw this article's title as being a bit sexually suggestive?

    Ugh. I must have spent far too much time on the computer again this weekend... :)

    --
    Please consider making an automatic monthly recurring donation to the EFF
  2. bad typo, but kind of funny by epine · · Score: 3, Funny


    pow(2,-6) was meant to be pow (2,-64) which rounds to 1% a with a great deal more drama.