Java Program for Binary Insertion Sort

We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the proper location to insert the selected item at each iteration.
In normal insertion, sort it takes O(i) (at ith iteration) in worst case. we can reduce it to O(logi) by using binary search.

Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program implementing
// binary insertion sort
  
import java.util.Arrays;
class GFG
{
    public static void main(String[] args)
    {
        final int[] arr = {37, 23, 0, 17, 12, 72, 31,
                             46, 100, 88, 54 };
  
        new GFG().sort(arr);
  
        for(int i=0; i<arr.length; i++)
            System.out.print(arr[i]+" ");
    }
  
    public void sort(int array[])
    {
        for (int i = 1; i < array.length; i++)
        {
            int x = array[i];
  
            // Find location to insert using binary search
            int j = Math.abs(Arrays.binarySearch(array, 0, i, x) + 1);
  
            //Shifting array to one location right
            System.arraycopy(array, j, array, j+1, i-j);
  
            //Placing element at its correct location
            array[j] = x;
        }
    }
}
  
// Code contributed by Mohit Gupta_OMG 

chevron_right


Please refer complete article on Binary Insertion Sort for more details!



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.