Binary Search in sorted array - Java

public class BinarySearch {
public static void main(String[] args) {
int[] nums = {1,2,3,4,5,6,7,8};
int num = 6;
        binSearch(nums, num);

}

public static void binSearch(int[] nums,int num){
int start = 0;
int end = nums.length - 1;

while(end > start){
int mid = (start+end)/2;
if(nums[mid] == num){
System.out.println("Number found" +num);
break;
}
else if(nums[mid] > num)
end = mid-1;
else if(nums[mid] < num)
start = mid+1;
}
}
}