public static int[] binInsertSort(int[] arr){
		arrTemp = arr.clone();
		for (int i = 0; i < arrTemp.length; i++) {
            int temp = arrTemp[i];
            int left = 0;
            int right = i-1;
            int mid = 0;
            while(left<=right){
                mid = (left+right)/2;
                if(temp<arrTemp[mid]){
                    right = mid-1;
                }else{
                    left = mid+1;
                }
            }
            for (int j = i-1; j >= left; j--) {
            	arrTemp[j+1] = arrTemp[j];
            }
            if(left != i){
            	arrTemp[left] = temp;
            }
        }
		return arrTemp;
	}