二分查找，如果查找的数字不在就返回它在队列应该出现的位置

package bin;

import java.util.Scanner;

public class BinSe {

public static void main(String[] args) {
	Scanner input = new Scanner(System.in);
	int[] mylist = { 1, 3, 3, 3, 6, 8, 8, 10 };
	System.out.println("Enter the number of key:");
	int key = input.nextInt();
	int i = BinarySearch(mylist, key);
	System.out.println("i=" + i);
	input.close();
}

private static int BinarySearch(int[] mylist, int key) {
	int high = mylist.length - 1;
	int low = 0;
	while (high >= low) {
		int mid = (low + high) / 2;
		if (mylist[mid] == key) {
			for(int i=1;i<mid;i++) {
			if (mylist[mid+i]==key)
				return mid+i;
			else
				return mid;
		}
		}
		if (mylist[mid] < key) {
			low = mid + 1;
		}
		if (mylist[mid] > key) {
			high = mid - 1;
		}

	}
	return low;
}

}