DSA Binary search, efficient search on sorted array

Using C++

//Binary search
              //0  1  2  3   4   5   6   
  int arr8[] = {1, 3, 4, 5 , 9, 11, 19, 25};

   //low 5 mid 4 high 4 
  int find = 26;
  int arr8Size = sizeof(arr8)/sizeof(int);
  int low = 0;
  int high = arr8Size-1;
  int mid;
  while(low <= high){
    mid = (low+high) / 2;
    if(arr8[mid] == find){
      cout << "Found at index " << mid;
      return 0;
    }else if(find < arr8[mid] ){
      high = mid-1;      
    }else{
      //means find item in right side
      low = mid+1;
    }
  }  
  cout << "Not found";
    
  return 0;