Korabbit/

Llama-2-7b-chat-hf-afr-441step-flan-v2

def binary_search(arr, target):
    # Initialize the index of the target element
    low = 0
    high = len(arr) - 1

    # Loop until the target element is found or the end of the array is reached
    while low <= high:
        # Calculate the middle index of the array
        mid = (low + high) // 2

        # Check if the target element is in the middle index
        if arr[mid] == target:
            return mid

        # If the target element is not in the middle index, check if it is less than the middle index
        if arr[mid] > target:
            low = mid + 1
        else:
            high = mid - 1

    # If the target element is not found in the array, return -1
    return -1

# Test the binary search function
arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
target = 5
result = binary_search(arr, target)
print(f"The target element {target} is at index {result}")