Consider Merging Two Sorted List algorithm. The least number of comparisons occurs when the elements of the smaller subarray are less than all entries in the larger subarray. For the array A={1,3,4,5,6,8,9,0,2,7}, are the elements of the smaller subarray less than all entries in the larger subarray.