Binary search is an algorithmic technique in computer programming used to search for a specific element in a sorted list or array by dividing the list or array into halves and eliminating the half of the elements in which the element being searched cannot be present. It is a fast and efficient searching technique that cuts down the search time considerably, making it a valuable skill in computer programming. However, it requires a specific set of skills and a deep understanding of the algorithm for efficient implementation.