Binary search, visualized step by step

data = [2, 5, 8, 12, 16, 23, 38, 56, 72, 91]
target = 23

lo = 0
hi = len(data) - 1
found = -1

while lo <= hi:
    mid = (lo + hi) // 2
    if data[mid] == target:
        found = mid
        break
    if data[mid] < target:
        lo = mid + 1
    else:
        hi = mid - 1

print(found)

#include <iostream>
#include <vector>
using namespace std;

int binarySearch(vector<int>& arr, int target) {
    int lo = 0;
    int hi = arr.size() - 1;

    while (lo <= hi) {
        int mid = lo + (hi - lo) / 2;
        if (arr[mid] == target) {
            return mid;
        }
        if (arr[mid] < target) {
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    return -1;
}

int main() {
    vector<int> arr = {1, 3, 5, 7, 9, 11};
    int found = binarySearch(arr, 9);
    cout << "index " << found << endl;
    return 0;
}

public class Main {
    public static void main(String[] args) {
        int[] arr = {1, 3, 5, 7, 9, 11, 13};
        int target = 11;
        int lo = 0;
        int hi = arr.length - 1;
        int found = -1;

        while (lo <= hi) {
            int mid = (lo + hi) / 2;
            if (arr[mid] == target) {
                found = mid;
                break;
            }
            if (arr[mid] < target) {
                lo = mid + 1;
            } else {
                hi = mid - 1;
            }
        }

        System.out.println(found);
    }
}