public static void binaryinsertsort(int[] a,int i){
		int left = 0,right = i-1;
		int temp = a[i];
		while (left<=right) {
			int middle=(left+right)/2;
			if (temp<a[middle]) {
				right= middle-1;
			}else {
				left = middle+1;
			}
		}
		for (int k=i-1;k>=left;k--){
			a[k+1] = a[k];
		}
		a[left] = temp;
	}