| 
|
QuoteRef: bentJ4_1998
topics >
all references >
ThesaHelp:
references a-b
Topic:
search algorithms
Topic:
hash table and hash functions
Reference
Bentley, J., Sedgewick, B., "Ternary search trees", Dr. Dobb's Journal, April 1998, pp. 20-25. Google
25 ;;Quote: ternary search trees better than binary trees, tries, and hashing; dynamic, fast operations including unsuccessful search and sort
ThesaHelp: references a-b (396 items)
Topic: search algorithms (40 items)
Topic: hash table and hash functions (41 items)