Java implementation of the non-recursive binary search - Big Data

import java.util.Scanner;

public class BinarySearch {
    public static void main(String[] args) {
        int[] src = new int[] { 1, 3, 5, 7, 9 };
        System.out.println("请输入要查找的数");
        Scanner sc=new Scanner(System.in);
        System.out.println(binarySearch(src,sc.nextInt()));
    }

    private static int binarySearch(int[] src, int data) {
        int sc=0;
        int low = 0;
        int high = src.length-1;
        while(low <= high){
            int middle = (low+high)/2;
            if(data < src[middle]){
                high = middle-1;
            }else if(data > src[middle]){
                low = middle+1;
            }else if(data == src[middle]){
                return middle;
            }
        }
        return -1;
    }
}

Hadoop Java Hive