Simple implementation of deletion from open-address hash table (...

Simple implementation of deletion from open-address hash tableMaxim A. KolosovskiyAltai State Technical University, Russia maxim.astu@gmail.comAbstractDeletion from open-address hash table is not so easy as deletion from chained hash table, because in open-address table we can’t simply mark a slot containing deleted key as empty. Search for keys may become incorrect. The classical method to implement deletion is to mark slots in hash table by three values: “free”, “busy”, “deleted”. That m