Foundation of Algorithms Using C++ Pseudocode, 3rd Edition.
By Richard Neapolitan and Kumarss Naimipour
Chapter 5 Backtracking
Backtracking is the technique to prune non-promising nodes in the state space tree.
CLRS
Ch 11 Hash Tables
11.3 Hash Functions
11.4 Open Addressing
Uniform hashing: idealized hashing function selects a permutation with equal prob.
Linear Probing: h(k,i) = ( h'(k) + i ) mod m
Quadratic Probing:
Double Hashing
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment