Write a C++ Code to implement. We are going to implement English dictionary by u

Question

Write a C++ Code to implement.

We are going to implement English dictionary by using a hash map. Dictionary data is given; import the data, “Oxford_English_Dictionary.txt”. Please try to use a couple of different hash functions and compare the performance. The goals are:

1. Implementation of Hasp map and loading a text file.

2. Compare the performance with difference hash functions

3. Show histograms of the numbers of buckets for different hash functions.

4. Make a conclusion what parameters are the best for the data.

Link to download Oxford_English_Dictionary.txt file

https://www.dropbox.com/s/yxskl0qt0a497ym/Oxford_English_Dictionary.txt?dl=0

Explanation / Answer

Let min = 0min=0 and max = n-1max=n1. Compute guessguess as the average of maxmax and minmin, rounded down so that it is an integer. If array[guess]array[guess] equals targettarget, then stop. You found it! Return guessguess. If the guess was too low, that is, array[guess]

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---