In java, someone plz help last time, the code didnt work

Implement two methods for quicksort and merge sort respectively in the SimpleArrayList class, and compare their performance on large size sequences.Completing the following method which re-organizes the current values in the array list in an ascending order using quicksort. Notice that you should only handle the filled cells in the list.

public void quickSort()

{

}

If you want to use recursion, please define the auxiliary or help functions as private methods in the class. Only the above method is exposed to users.Completing the following method which re-organizes the current values in the array list in an ascending order using merge sort. Notice that you should only handle the filled cells in the list.

public void mergeSort()

{

}

If you want to use recursion, please define the auxiliary or help functions as private methods in the class. Only the above method is exposed to users.

Please write a testing program for your methods. For each sorting method, you should randomly generate 10 numbers, add them to an empty simple array list, and display the list content before and after sorting. We compare the performance of quicksort and merge sort on large random arrays. Similar to the previous question, you are required to randomly build a simple array list whose size is close to (2^31)-1 which is the maximum array size allowed in Java. Then you make a copy of the array list, and perform quicksort and merge sort on the original array list and its copy respectively. It ensures that the two sorting methods are applied to the same array content. Perform the above steps on several random large array lists, and show the time cost comparison. (You are required to write these testing programs but please do not display the array content.)