In a binary search, the values of Low (identified initially, the first element in the array) and High (identified initially, the last element in the array) will never change as the program executes....

In a binary search, the values of Low (identified initially, the first element in the array) and High (identified initially, the last element in the array) will never change as the program executes. In a serial search, the search key (the value being searched for) is compared with each element in an array until a match is found or there are no more elements in the array.