1def binary_search(arr, target):
2    low = 0
3    high = len(arr) - 1
4
5    while low <= high:
6        mid = (low + high) // 2
7        if arr[mid] == target:
8            return mid
9        elif arr[mid] < target:
10            low = mid + 1
11        else:
12            high = mid - 1
13
14    return -1

1def binary_search(arr, target):
2    arr.sort() # Sort the array before performing binary search
3
4    low = 0
5    high = len(arr) - 1
6
7    while low <= high:
8        mid = (low + high) // 2
9        if arr[mid] == target:
10            return mid
11        elif arr[mid] < target:
12            low = mid + 1
13        else:
14            high = mid - 1
15
16    return -1

1def binary_search(arr, target):
2    arr.sort() # Sort the array before performing binary search
3
4    low = 0
5    high = len(arr) - 1
6
7    while low <= high:
8        mid = (low + high) // 2
9        if arr[mid] == target:
10            return mid
11        elif arr[mid] < target:
12            low = mid + 1
13        else:
14            high = mid - 1
15
16    return -1
17
18# Test cases
19print(binary_search([1, 2, 3, 4, 5], 3)) # Expected output: 2
20print(binary_search([1, 2, 3, 4, 5], 6)) # Expected output: -1
21print(binary_search([5, 4, 3, 2, 1], 3)) # Expected output: 2
22print(binary_search([5, 4, 3, 2, 1], 6)) # Expected output: -1
23print(binary_search([], 1)) # Expected output: -1

1def binary_search(arr, target):
2    arr.sort() # Sort the array before performing binary search
3
4    low = 0
5    high = len(arr) - 1
6
7    while low <= high:
8        mid = (low + high) // 2
9        if arr[mid] == target: # If the middle element is equal to the target, return its index
10            return mid
11        elif arr[mid] < target: # If the middle element is less than the target, search in the right half of the array
12            low = mid + 1
13        else: # If the middle element is greater than the target, search in the left half of the array
14            high = mid - 1
15
16    return -1 # If the target is not found, return -1
17
18# Test cases
19print(binary_search([1, 2, 3, 4, 5], 3)) # Expected output: 2
20print(binary_search([1, 2, 3, 4, 5], 6)) # Expected output: -1
21print(binary_search([5, 4, 3, 2, 1], 3)) # Expected output: 2
22print(binary_search([5, 4, 3, 2, 1], 6)) # Expected output: -1
23print(binary_search([], 1)) # Expected output: -1