Key.md (417B)
1 # Key 2 3 Ch 5 4 5 **Definition:** A key is list of attribute of an object x that uniquely identifies it from all other elements of our universe. 6 7 In hashtables we hash the keys and then store the items. When openaddressing, if the queried for object is not the one at the address, we continue on with our probing algorithm until we find the item or find an empty spot (this assumes we don't remove items from our table).