Binary search in a sorted array

public class Main
{
    public static void binarySearch(int[] a, int value){
        int left,right,middle;

        left = 0;
        right = a.length-1;
        while(left<=right){
            middle = (left+right)/2;
            if(a[middle] == value){
                System.out.println("Found in position: " + middle);
                return;
            }
            if(a[middle] < value){
                left = middle + 1;
            }
            else{
                right = middle - 1;
            }
        }
        System.out.println("Not found");

    }

    public static void main(String[] args) {
        int[] array = {1,2,3,4,5,6,7,8,9,10};
        binarySearch(array,8);
    }
}