Texas A&M University Assistant Professor Interview Questions and Answers

Binary search is a search algorithm that finds the position of a target value within a sorted array.

• Binary search works by repeatedly dividing the search interval in half.

• It is more efficient than linear search for large arrays.

• Example: Searching for the number 7 in the array [1, 3, 5, 7, 9, 11] using binary search.