Define Linear Probing

Linear Probing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the record in the next available position in the array. This method is known as linear probing. An empty record is indicated by a special value known as null. The array should be considered circular, so that when the last location is reached the search proceeds to the first record of the array. An unoccupied record location is forever found using this method if at least one is available; or else, the search halts unsuccessfully after scanning all locations. The main drawback of the linear probe method is that of clustering.