Another way of improving performance of hashing is to allow reogranization of hash table during insertions. Write a program that compares the performance of linear probing with the following self-organization hashing methods:
a) Last-come-first-served hasing places a new element in its home position, and in case of a collision, the element that occupies this position is inserted in another position using a regular linear probing method to make room for the arriving element (Poblete and Munro, 1989).
b) Robin Hood hashing checks the number of positions two colliding keys are way from thier home poistions and continues searching for an open position for the key closer to its home position (Celis et al., 1985)
CODE SHOULD INCLUDE COMMENTS... COMPILE IN DEV C++4.0
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
Windows 2000 and XP, Compile in Dev C++ 4.0