Binary Search

Concept: Binary Search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item.

Steps:

• Middle: Compare the target value to the middle element of the array.
• Match: If they are equal, the position is returned.
• Divide: If the target is less than the middle element, the search continues in the lower half. If greater, it continues in the upper half.
• Repeat: This process repeats until the target is found or the search interval is empty.