Here's a big list of algorithms, with possible applications to this
project. I've seen these in various source code, in Sedgewick's
_Algorithms_, and in Knuth's _The Art of Computer Programming_.
ALGORITHMS / DATA STRUCTURES
- Priority heap/queue
- Task scheduling
- Storage allocation (free disk sectors, free RAM pages)
- Trees
- Red-black tree (rbtree) - balanced, unlike a binary tree
- Binary tree
- Radix tree (trie)
- Quasi-Radix Tree (QRT)
- Radix sort/search (bit manipulation - very efficient)
- Object lookups
- String matching??
- Hashing
- Various.......
APPLICATIONS
- Persistent Store (Object Database)
- External sorting & searching algorithms
- String matching (for linking) - Rabin's algorithm??