How can I optimize binary search for better performance?

How can I optimize binary search for better performance?

To optimize binary search, ensure your data is sorted and consider using iterative methods instead of recursion.

What are the time complexities involved in binary search?

Binary search has a time complexity of O(log n), which is efficient for searching in sorted arrays.

Are there any specific scenarios where binary search is not effective?

Yes, binary search is not effective for unsorted data or when searching for elements in linked lists.

Can you give me an example of binary search in code?

Sure! Here's a simple Python implementation:

def binary_search(arr, target):
    left, right = 0, len(arr) - 1
    while left <= right:
        mid = left + (right - left) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1