Compare Proposal

Nothing to compare.

I need c++ programmers to work on assignment

  • Posted at : 28 days ago
  • Post Similar Project
500

Budget
6
Proposals
39
Views
Awarded
Status
Skills Required

Posted By -

AB

5.0
Projects Posted : 1
Projects Paid : 1
Services Purchased : 0
Total Spent :
3
Feedbacks : 100 %

Project Details show (+) hide (-)

Assignment in C++
In our open-address hash tables, we have used linear probing or double hashing. Another probing method, which avoids some clustering, is called quadratic probing. The simplest version of quadratic probing works like this: Start by hashing the key to an array index. If there is a collision, then move to the next array index. If there is a second collision, then move forward two more spots through the array. After a third collision, we move forward three more spots, and so on. For example, suppose that a new key hashes to location 327, and this location is full. The next location that we try is 328. If 328 is a second collision, then we move two spots forward to location 330. If 330 is the third collision, then we move three spots forward to location 333. If our calculation of the next spot takes us beyond the end of the array, then we "wrap around" to the front of the array (similar to double hashing). In general, if data[i] is the location that has just caused a collision, and we have already examined count elements, then we increase according to the assignment:
i = (i + count) % CAPACITY;
In this formula, the "% CAPACITY" causes the "wraparound" to the front of the array. In order for
this approach to work correctly, the capacity must be a power of 2, such as. Otherwise, the sequence of probes does not correctly examine all array items. For this project, use quadratic hashing to reimplement the hash table.
I just need a member function with code and comments explaining the choices of variables.