How does Binary Search work?

Oa$.$ It compares adjacent elements and swaps then if they are in the wrong order

Ob$.$ It repeatedly divides the search interval in half until the target value is found or the interval is empty

Oc It divides the array into smaller sub$-$arrays and searches them recursively

Od$.$ It iterates through each element in the array sequentially until it finds the target value