fill it too full (for exampleif you try to put items in -cell tableyou may think the program has stoppedbut be patient it' extremely inefficient at filling an almost-full array alsonote that if the hash table becomes completely full the algorithms all stop workingin this applet they assume that the table has at least one empty cell the find button the find button starts by applying the hash function to the key value you type into the number box this results in an array index the cell at this index may be the key you're looking forthis is the optimum situationand success will be reported immediately howeverit' also possible that this cell is already occupied by data item with some other key this is collisionyou'll see the red arrow pointing to an occupied cell following collisionthe search algorithm will look at the next cell in sequence the process of finding an appropriate cell following collision is called probe following collisionthe find algorithm simply steps along the array looking at each cell in sequence if it encounters an empty cell before finding the key it' looking forit knows the search has failed there' no use looking furtherbecause the insertion algorithm would have inserted the item at this cell (if not earlierfigure shows successful and unsuccessful linear probes figure linear probes the ins button the ins button inserts data itemwith key value that you type into the number boxinto the hash table it uses the same algorithm as the find button to locate the appropriate cell if the original cell is occupiedit will probe linearly for vacant cell when it finds oneit inserts the item try inserting some new data items type in -digit number and watch what happens most items will go into the first cell they trybut some will suffer collisionsand need to step along to find an empty cell the number of steps they take is the probe length most probe lengths are only few cells long sometimeshoweveryou may see probe lengths of or cellsor even longer as the array becomes excessively full notice which keys hash to the same index if the array size is the keys and so on up to all hash to index try inserting this sequence or similar one this will demonstrate the linear probe