3. Evolution of the States' Collection
- In order to search efficiently we need to keep a collection of states which we encountered so far.
- That is so they (and their derived states) won't be traversed to again and again.
- But how do we manage this collection?
- 3.1. Initial Perl Version - Flat List
- 3.2. First C Version - Sorted Array
- 3.3. Binary-Search-Based Merge to Add the Sort Margin
- 3.4. Array of Pointers
- 3.5. A Balanced Binary Tree
- 3.6. A Hash Table