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?"

1 of 48 comments (clear)

  1. No replies by CounterZer0 · · Score: 0, Troll

    You won't get many replies, 'cause you forgot to tie in DRM or something that incites feeling in everybody....actually asking something technical, jeez. On /. ?
    Good luck! :)