Binary Search is an efficient algorithm that finds a target value in a sorted array. It halves the search space with each step, zeroing in on the target with precision.
Fast and memory-efficient on large sorted arrays
Effective with uniformly distributed elements
Divide and conquer approach for quick searching
For Binary Search you will need to pre sort the array before start.