What is the time complexity in Big-O notation for the binarySearch method shown below?

public int binarySearch(int[] sorted, int target) {
    int low = 0, high = sorted.length - 1;
    while(low <= high) {
        int mid = (low + high) / 2;
        if(sorted[mid] == target) return mid;
        else if(sorted[mid] < target) low = mid + 1;
        else high = mid - 1;
    }
    return -1;
}