Can you explain iterative binary search with an example?

Can you explain iterative binary search with an example?

Sure! Iterative binary search is an efficient algorithm for finding an item from a sorted list. It works by repeatedly dividing the search interval in half.

How does it differ from recursive binary search?

The main difference is that iterative binary search uses a loop to repeat the search process, while recursive binary search calls itself with a smaller subset of the list.

Can you show me a code example of iterative binary search?

Absolutely! Here's a simple Python implementation:

def iterative_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

This function returns the index of the target if found, or -1 if not.

What is the time complexity of this algorithm?

The time complexity of iterative binary search is O(log n), making it very efficient for large datasets.