Programming Assignment Pseudocode and Reflection - 5-2 - Caine Mongeau.docx

The purpose of this code is to use hashing and hash tables to uniquely hold many bid objects while also
using chaining to handle collisions. The code has functions to free up storage when the processes end, to
calculate a hash value, insert a bid, printing all of the bids, removing a bid and searching for a bid by id.
The main challenge I faced in developing this code is that hashing and the related language is complex
and somewhat hard to understand at first glance. I was able to utilize our resources and the zyBooks to
overcome those challenges and really understand how sorting algorithms work to make this program do
what I needed it to do.
Task 1
Private:
CREATE a structure called Node
INITIALIZE a Bid object called bid
INITIALIZE an unsigned integer called key
INITIALIZE a node pointer called nextNodePtr
CREATE constructor functions to give the above variables value and to initialize a bid
INITIALIZE a vector of nodes called myNodes