JAVA PROGRAMMING

BIG O Questions

a. What is the space complexity of the above algorithm? In other words, how much space is used up as a function of the input size? Think about it, we didnt cover this in the videos.

b. What is the time complexity of the above algorithm?

* * https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#Java public static void insertSort(int[] A) { for(int i = 1; i = 0 && A[j] > value) { A[j + 1] = A[j]; j = j - 1; A[j + 1] = value