Answered step by step
Verified Expert Solution
Question
1 Approved Answer
std::list * mTable; // A dynamic array of lists (these are the buckets) size_t mNumBuckets; // Number of elements in mTable unsigned int(*mHashFunc)(const Key&); //
std::list
size_t mNumBuckets; // Number of elements in mTable
unsigned int(*mHashFunc)(const Key&); // Pointer to the hash function
public:
// Constructor
// In: _numBuckets The number of elements to allocate
// _hashFunc The hashing function to be used
Dictionary(size_t _numBuckets, unsigned int (*_hashFunc)(const Key&))
{
// TODO: Implement this method
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started