- The problem of designing efficient data structures that implement associative arrays. The two major solutions to the dictionary problem are hash tables and search trees. It is sometimes also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures. ← Wikipedia
- Related terms: Associative array · Maximum subarray problem · Hash table · Root cause analysis
- Previous term: Dictionary
- Next term: Diff
- Random term: Chrome Custom Tabs (webglossary.info/random 🎲)