ArrayBinarySearch In Java

I can’t find why the code is not working. The output is as if there is an infinite loop. But I can’t find what is wrong. https://ide.codingblocks.com/s/133683

public class main {

	public static void main(String[] args) {
		int numbers[] = {5,7,10,12,15,20,27,31,36,42,55,58,60,65,70,80};
      int index = binarysearch(numbers,55);
      if (index == -1) {System.out.println("The array does not include this number");}
      else {System.out.println("This number is present at index number " + index);}
	}
public static int binarysearch(int[] numbers, int search) {
	int lo=0;
	int hi=numbers.length-1;
	
	while(lo<=hi) {
        int mid = (lo + hi)/2;//Calculate mid inside while loop

		if(numbers[mid]<search) {lo = mid +1; }
		else if(numbers[mid]>search) {hi = mid -1;}
		else {return mid;}
	}
	return -1;
}
}

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.