Search
Next:
0.2.1 Linear Search
Up:
Algorithm Archive (Work in
Previous:
0.1.4 Example Code
0.2 Data Searching and Storage
0.2.1 Linear Search
0.2.1.1 Source Code
0.2.2 Binary Search
0.2.2.1 Analysis
0.2.2.2 Source Code
0.2.2.3 References
0.2.3 Binary Search Trees
0.2.3.1 Inserting and Deleting Nodes
0.2.3.2 Source Code
0.2.3.3 References
0.2.4 Red-Black Trees
0.2.4.1 Insertion Operation
0.2.4.2 Deletion
0.2.4.3 Source Code
0.2.4.4 References
0.2.5 B+-Trees
0.2.5.1 Source Code
0.2.6 Boyer-Moore String Searching
0.2.6.1 Source Code
0.2.6.2 References
0.2.7 Hashing
0.2.7.1 Selecting a Hash Function
0.2.7.2 Dealing with Collisions
0.2.7.3 Choosing a Table Size
0.2.7.4 Source Code
0.2.7.5 One-way hashing
0.2.7.6 References
0.2.8 Skip lists
0.2.8.1 Source Code
0.2.8.2 References
0.2.9 Tries
0.2.9.1 Source Code
0.2.10 Quadtrees and Octrees
0.2.10.1 Octree Source Code
Scott Gasch
1999-07-09
Search