Question

Discuss the running time of an insertion sort in terms of n, the number of elements in an array.( Java Language)

Answer 1

public class InsertionSortInt {
    public static void insertionSort(int[] arr){
        for (int i=1; i<arr.length; ++i){
            int key = arr[i];
            int j = i-1;
            while (j>=0 && arr[j] > key){
                arr[j+1] = arr[j];
                j = j-1;
            }
            arr[j+1] = key;
        }
    }

    public static void main(String[] args) {
        int testArray[] = {8, 9, 10, 4, 2, 1, 7, 5};
        insertionSort(testArray);
        for(int i = 0;i<testArray.length;i++){
            System.out.print(testArray[i]+" ");
        }
        System.out.println();
    }
}

This code has two loops each is running for n imes.

So, time complexity = O(n*n) = O()