public static void shuffle(Object[] obj){} It shuffles an array in nlog(n) time using recursion. You must not use helper methods or change parameters. Assume calls to the Random library happen in constant time. It should be possible for any element to re-position to any other position. After completion, explain

Write a version of the bubble sort algorithm that sorts a list of integers in descending order. Namely, change the bubble sort method to sort the parameter array in descending order. Hint: Bubble sort: void bubbleSort(int array(1) { int size = array.length; boolean isChanged = false; for (int i = 0; i < size - 1; i++) isChanged = false; for (int j = 0; j < size . 1 . 1; j++) if (array(s) > array() + 1]) { int temp = array(s); array[3] . arrays + 1); array() + 1] = temp; is Changed = true; } if (isChanged) break;

Refer to the ArrayCollection.java) in your Canvas Modules. If N represents the number of elements in an ArrayCollection, then the add method in that collection instance is of which of the following efficiency? O O(N) O(log N) O(1) O None of the choices O(N log N)

Task - 2: Write a java program (AnyTypeMergeSort.java) to implement the Merge Sort algorithm to sort the array containing any type of elements (suppose strings). Your program will have the following method signature: ● ● public void mergeSort(T[] A, int lowerBound, int upperBound) public void merge(T[] A, int lowerBound, int midPoint, int upperBound) Following is the Merge Sort Algorithm MERGE-SORT (A, p,r) 1 if p≥r 2 3 4 5 6 // Merge A[p:q] and A[q + 1:r] into A[p:r]. 7 MERGE(A, p, q, r) 4 Where p and r represent lower (starting index) and upper (ending index) bounds of array A respectively. The Merge Sort calls the following Merge Algorithm that accepts q as the mid of the array along with p and r: MERGE(A, p, q, r) 1 n₂ = q-p+1 2 nR=r-9 3 let L[0:n 5 6 7 8 9 10 11 return ANZEIGEN q = [(p+r)/2] MERGE-SORT(A, p, q) MERGE-SORT (A, q + 1,r) 22 25 26 27 i = 0 j = 0 k = p 12 13 14 15 16 17 18 19 // Having gone through one of L and R entirely, copy the // remainder of the other to the end…

in java

make the array an arraylist instead and include the file you used

Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.

A. Can you draw the animation of Merge sort: given an unsorted array of size 10, show the divide andconquer techniqueb. What is Running time for Merge Sort: O(nlogn) such that n is the size of thearray: Reference code attached

write a java program that implements the selection sort algorithum that sorts list of doubles in the range of [0,500). use array objects that use to contain the list

Mergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method    public static int[] mergesort(int[] arr) {         return new int[] {-1};     }     *must be in this layout and done in java