Algorithms & Data Structures
88 Citations•2008•
R. Haenni
journal unavailable
A dictionary implementation based on hash tables, which handles collisions with linear probing with pseudo-code algorithms for inserting and removing elements, which use a special marker AVAILABLE to represent deleted elements is considered.
Abstract
3. Linear Probing and Rehashing Consider a dictionary implementation based on hash tables, which handles collisions with linear probing. a) Write respective pseudo-code algorithms for inserting and removing elements, which use a special marker AVAILABLE to represent deleted elements. The algorithm for inserting an element should also include a solution for rehashing the array if it is full. b) Do the same, but without using a special marker.