How does Binary Search work?

A$)$ It checks each element in the array until a match is found

B$)$ It recursively divides the array into two halves and compares the middle element

C$)$ It finds the minimum element and swaps it with the first unsorted element

D$)$ It uses a pivot to locate the desired element

E$)$ it randomly selects elements for sorting