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 programing language such as Java and add your screenshots of the output.

show the steps please

Answer 1

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

class Main{

    public static void insertionSort(int [] arr){
        for(int i=1;i<arr.length;i++){
            //Store element in var a
            int a = arr[i];
            //To perform binary search
            int start=0;
            int end = i-1;
            int mid = (start+end)/2 ;
            //Perform binary search until start<end
            while(start<end){
                //Compare element with mid
                if(a>arr[mid]){
                    //If element is greater than mid element, then update start
                    start = mid+1;
                }
                //Otherwise update end
                else if(a<arr[mid]){
                    end = mid;
                }
                //If match found, break
                else{
                    break;
                }
                //Find mid again
                mid = (start+end)/2;
            }
            //Check if eleement at mid is greater than the element, Otherwise, no need to insert.
            if(a<arr[mid]) {
                //Shift all elements to right
                for (int j = i; j > mid; j--) {
                    arr[j] = arr[j - 1];
                }
                //Insert element at mid
                arr[mid] = a;
            }
        }
    }

    public static void main(String[] args) {
        int arr[] = {2,5,1,4,3};
        insertionSort(arr);
        System.out.println(Arrays.toString(arr));
    }
}

OUTPUT :

IVIUI TITULU Run: Main x E "C:\Program Files\Java \jdk-13\bin\java.exe" "-javaagen [1, 2, 3, 4, 5] / Structure → If 71 Process finished with exit code o u