<ul><li>Binary search is a simple search technique that works on a sorted array.</li><li>The steps to perform binary search are: compare the middle element with the key, if key is found return the index, if key is less than the middle element, search in the left half, if key is greater than the middle element, search in the right half.</li><li>Binary search has a time complexity of O(log n), where n is the number of elements in the array.</li><li>An example C program for binary search implementation is provided.</li></ul>

Searching Algorithm 2: Binary search

Discover more