What is the time and space complexity of this function?

int g(int arr[], int n, int target) {

   int low = 0, high = n - 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;  

}