Binary Search in computer science is a search algorithm that finds the position of a target value within a sorted array by comparing the target value to the middle element of the array.