Question

Write an insertion sort algorithm that uses Binary search to find the position where the next insertion should take place. Show your work using a java programing languageand add your screenshots of the output.

Answer 1

Java implementation od insertion sort using binary tree is below:

import java.util.Arrays;

class BInaryInsertionSort

{

public static void main(String[] args)

{

int[] array = {10,67,13,9,103,45 };

System.out.println("Array before sort is");

for(int i=0; i<array.length; i++)

System.out.print(array[i]+" ");

System.out.println("\nArray after sort is");

new BInaryInsertionSort().insertionSort(array);

for(int i=0; i<array.length; i++)

System.out.print(array[i]+" ");

}

public void insertionSort(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;

}

}

}

please find output of the same program in screenshot.