Finds the middle item in an ordered list by doing(n+1)/2.If the middle item is what is is searching for it stops.If not,it compares the itme you are seraching for to the middle item so that is knows whethere to look in the first half or second half of the list.Then it repeats these steps until item is found.