figure deleting an item if the item in cell ( in the figureis deletedthen the item in would shift into the item in would shift into and so on to the last occupied cell during the deletion processonce the item is locatedthe applet will shift down the contents of the higherindexed cells as you continue to press the del button deletion requires (assuming no duplicates are allowedsearching through an average of / elementsand then moving the remaining elements (an average of / movesto fill up the resulting hole this is steps in all the duplicates issue when you design data storage structureyou need to decide whether items with duplicate keys will be allowed if you're talking about personnel file and the key is an employee numberthen duplicates don' make much sensethere' no point in assigning the same number to two employees on the other handif the key value is last namesthen there' distinct possibility several employees will have the same key valueso duplicates should be allowed of coursefor the baseball playersduplicate numbers should not be allowed it would be hard to keep track of the players if more than one wore the same number the array workshop applet lets you select either option when you use new to create new arrayyou're prompted to specify both its size and whether duplicates are permitted use the radio buttons dups ok or no dups to make this selection if you're writing data storage program in which duplicates are not allowedyou may need to guard against human error during an insertion by checking all the data items in the array to ensure that none of them already has the same key value as the item being inserted this is inefficienthoweverand increases the number of steps required for an insertion from one to for this reasonour applet does not perform this check searching with duplicates allowing duplicates complicates the search algorithmas we noted even if it finds matchit must continue looking for possible additional matches until the last occupied cell at least this is one approachyou could also stop after the first match it depends on whether the question is "find me everyone with blue eyesor "find me someone with blue eyes when the dups ok button is selectedthe applet takes the first approachfinding all items matching the search key this always requires stepsbecause the algorithm must go all the way to the last occupied cell