7.Binary Insertion Sort

package sorting;
import java.util.*;
import java.io.*;
public class binaryInsertion {
	static void binInsertion(int arr[]) {
		for (int i = 1; i < arr.length; i++) 
        {
            int x = arr[i];
  
            // Find location to insert
            // using binary search
            int j = Math.abs(Arrays.binarySearch(arr, 0, i, x) + 1);
  
            // Shifting array to one
            // location right
            System.arraycopy(arr, j,arr, j + 1, i - j);
  
            // Placing element at its 
            // correct location
            arr[j] = x;
        }
	}
	
	static void printArray(int arr[]) {
		 int n=arr.length;
		 for(int i=0;i<n;i++) {
			 System.out.print(arr[i]+" ");}
			 System.out.println();
		 
	 }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] arr = { -9,2,5,7,12};
		binInsertion(arr);
		System.out.println("the sorted array is:");
		printArray(arr);
	}

}