Summer of CS 2025 Final Jeopardy :o

Final Jeopardy

0

The runtime of the following code snippet:

int someSearchAlgorithm(const vector<int>& arr, int target) {
    int low = 0, high = arr.size() - 1;
    while (low <= high) {
        int mid = (low + high) / 2;
        if (arr[mid] == target) return mid;
        else if (arr[mid] < target) low = mid + 1;
        else high = mid - 1;
    }
    return -1;
}

What is O(log n)?