in the recfind(method in the binarysearch java program (listing )what takes the place of the loop in the non-recursive versiona the recfind(method arguments to recfind( recursive calls to recfind( the call from main(to recfind( the binarysearch java program is an example of the approach to solving problem what gets smaller as you make repeated recursive calls in the redfind(method what becomes smaller with repeated recursive calls in the towers java program (listing ) the algorithm in the towers java program involves "treesthat are data storage devices secretly putting small disks under large disks changing which columns are the source and destination moving one small disk and then stack of larger disks which is not true about the merge(method in the merge java program (listing ) its algorithm can handle arrays of different sizes it must search the target array to find where to put the next item it is not recursive it continuously takes the smallest item irrespective of what array it' in the disadvantage of mergesort is that it is not recursive it uses more memory although faster than the insertion sortit is much slower than quicksort it is complicated to implement besides loopa can often be used instead of recursion