The add method of the sorted array-based list implementation takes 0(N) time because searching in the array takes O(N) time. True False

int [] list = {18,57,8,89,7} and the length = 5 Sort the array using insertion sort algorithm. Fill out the trace table public class InsertionSort { /** The method for sorting the numbers */ public static void insertionSort(int[] list) { for (int i = 1; i < list.length; i++) { /** insert list[i] into a sorted sublist list[0..i-1] so that list[0..i] is sorted. */ int currentElement = list[i]; int k; for (k = i - 1; k >= 0 && list[k] > currentElement; k--) { list[k + 1] = list[k]; } // Insert the current element into list[k+1] list[k + 1] = currentElement; } } /** A test method */ public static void main(String[] args) { int[] list = {18,57,8,89,7}; insertionSort(list); for (int i = 0; i < list.length; i++) System.out.print(list[i] + " "); } }

Write code to modify the recursive sort also to do the closest-point computation when pass is 2?

Sort the array using insertion sort algorithm list ={18,57,8,89,7}

Write code to modify the recursive sort also to do the closest-point computation when pass is 2?

Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array "a" from"index" to "n-1" index values.swap is a separate function that swaps elements in the given array "a" between theelements at index "k" and "index" respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then...

Using Java. Import ArrayList

what is the big oh notation of the algorithm if the sorted list as array based implementation

There exist sorting algorithms which can sort any list with N elements in O(N log N) time. True False

There are two n-element arrays A and B the task is to permute them such that A[i]+b[i]>=k Can someone walk me through the code. I dont understand the iList and jList and why we have if j and i not in List we do List.append. Also at the end why we do if len(iList)+len(jList)==len(A)+len(B) ? def twoArrays (k, A, B): A.sort() B. sort() iList = [] jList = [] for i in range (len (A)): for j in range (len (B)): if(A[i]+B[j]>=k): if j not in jList and i not in iList: iList.append(i) jList.append(j) print (iList) print (jList) if(len (iList) + len(jList) ==len (A) + len(B)) return "YES" else: return "NO"