if getkey()then we have found the entry we were looking forand the search terminates successfully returning if getkey()then we recur on the first half of the array listthat ison the range of indices from low to mid if getkey()we recur on the range of indices from mid to high this search method is called binary searchand is given in pseudo-code in code fragment operation find(kon an -entry dictionary implemented with an ordered array list consists of calling binarysearch( , , , code fragment array list binary search in an ordered we illustrate the binary search algorithm in figure figure example of binary search to perform operation find( )in dictio nary with integer keysimplemented with an ordered array list for simplicitywe show the keys stored in the dictionary but not the whole entries