Java Program I need help making a function to impliment a Me

Java Program: I need help making a function to impliment a Merge sort and one for a quick sort. Here is my code so far, I just need help making the sorting functions

package semesterproject;
import java.util.Random;

public class SemesterProject {
public static int[] Array20;
public static int[] Array100;
public static int[] Array200;

public static int[] RandomArrayGenerator(int size){
int array[];
array = new int[size];
for(int i=0;i <size;i++) {
array[i] = (int) (Math.random() * 10000);
}
return array;
}
public static void main(String args[]) {
Array20 = RandomArrayGenerator(20);
Array100 = RandomArrayGenerator(100);
Array200 = RandomArrayGenerator(200);
System.out.println(\" \");
System.out.println(\"--------------------20 ELEMENTS----------------------\");
  
//INSERTION SORT ARRAY 20
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 20 ELEMENTS\");
//THIS IS THE INSERTION SORT OF THE 20 ELEMENT ARRAY

SortClass insertionArray20 = new SortClass(Array20, 20);
insertionArray20.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 20 ELEMENT ARRAY
SortClass selectionArray20 = new SortClass(Array20, 20);
selectionArray20.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");

//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 20 ELEMENTS ARRAY
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 20 ELEMENTS ARRAY
//**************************

System.out.println(\" \");
System.out.println(\"--------------------100 ELEMENTS----------------------\");
System.out.println(\" \");
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 100 ELEMNTS\");
//THIS IS THE INSERTION SORT OF THE 100 ELEMENT ARRAY
SortClass insertionArray100 = new SortClass(Array100,100);
insertionArray100.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 100 ELEMENT ARRAY
SortClass selectioArray100 = new SortClass(Array100,100);
selectioArray100.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");

//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 100 ELEMENTS ARRAY
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 100 ELEMENTS ARRAY
//**************************

System.out.println(\" \");
System.out.println(\"----------------------200 ELEMNTS--------------------\");
System.out.println(\" \");
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 200 ELEMNTS\");
//THIS IS THE INSERTION SORT OF THE 200 ELEMENT ARRAY
SortClass insertionArray200 = new SortClass(Array200,200);
insertionArray200.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 200 ELEMENT ARRAY
SortClass selectioArray200 = new SortClass(Array200,200);
selectioArray200.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");

//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 200 ELEMENTS ARRAY
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 200 ELEMENTS ARRAY
//**************************

//COMPARISON TIME
System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 20 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray20.time);
System.out.println(\"Selection Sort \"+selectionArray20.time);
System.out.println(\"Merge Sort \");
System.out.println(\"Quick Sort \");

System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 100 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray100.time);
System.out.println(\"Selection Sort \"+selectioArray100.time);
System.out.println(\"Merge Sort \");
System.out.println(\"Quick Sort \");

System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 200 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray200.time);
System.out.println(\"Selection Sort \"+selectioArray200.time);
System.out.println(\"Merge Sort \");
System.out.println(\"Quick Sort \");
}
}

class SortClass{
int [] Mainarray;
int size;
long time;
public SortClass(int array[],int size1){
size = size1;
Mainarray= array.clone();
time = 0;
}

void insertionSort() {

for (int i=0; i<size;i++) {
int key = Mainarray[i];
int j = i - 1;

while (j > -1 && (Mainarray[j] > key)) {
Mainarray[j + 1] = Mainarray[j];
j--;
}
Mainarray[j + 1] = key;
}

}

void insertionSortandTimer(){
final long starttime = System.nanoTime();
insertionSort();
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Insertion Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+ \" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;
print();
}

void print() {
for(int i =0;i<Mainarray.length;i++){
System.out.print(\"Mainarray [\"+(i+1)+\"]\"+Mainarray[i] +\" \");
}
}

void selectionsort(){
for(int i = 0;i<Mainarray.length;i++)
{

int min = i;
for(int j = i + 1;j<Mainarray.length;j++)
{
if(Mainarray[j] < Mainarray[min]) { min = j;}
}
int temp = Mainarray[i];
Mainarray[i] = Mainarray[min];
Mainarray[min] = temp;

}

}

void selectionSortandTimer(){
final long starttime = System.nanoTime();
selectionsort();
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Selection Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+\" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;

print();
}

//*** Merge sort and quick sort
}

Solution

package semesterproject;
import java.util.Random;
public class SemesterProject {
public static int[] Array20;
public static int[] Array100;
public static int[] Array200;
public static int[] RandomArrayGenerator(int size){
int array[];
array = new int[size];
for(int i=0;i <size;i++) {
array[i] = (int) (Math.random() * 10000);
}
return array;
}
public static void main(String args[]) {
Array20 = RandomArrayGenerator(20);
Array100 = RandomArrayGenerator(100);
Array200 = RandomArrayGenerator(200);
System.out.println(\" \");
System.out.println(\"--------------------20 ELEMENTS----------------------\");
  
//INSERTION SORT ARRAY 20
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 20 ELEMENTS\");
//THIS IS THE INSERTION SORT OF THE 20 ELEMENT ARRAY
SortClass insertionArray20 = new SortClass(Array20, 20);
insertionArray20.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 20 ELEMENT ARRAY
SortClass selectionArray20 = new SortClass(Array20, 20);
selectionArray20.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 20 ELEMENTS ARRAY
SortClass mergeArray20 = new SortClass(Array20, 20);
mergeArray20.mergeSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 20 ELEMENTS ARRAY
//**************************
SortClass quickArray20 = new SortClass(Array20, 20);
quickArray20.quickSortandTimer();
System.out.println(\" \");
System.out.println(\"--------------------100 ELEMENTS----------------------\");
System.out.println(\" \");
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 100 ELEMNTS\");
//THIS IS THE INSERTION SORT OF THE 100 ELEMENT ARRAY
SortClass insertionArray100 = new SortClass(Array100,100);
insertionArray100.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 100 ELEMENT ARRAY
SortClass selectioArray100 = new SortClass(Array100,100);
selectioArray100.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");

//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 100 ELEMENTS ARRAY
SortClass mergeArray100 = new SortClass(Array100, 100);
mergeArray100.mergeSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 100 ELEMENTS ARRAY
//**************************
SortClass quickArray100 = new SortClass(Array100, 100);
quickArray100.quickSortandTimer();
System.out.println(\" \");
System.out.println(\"----------------------200 ELEMNTS--------------------\");
System.out.println(\" \");
System.out.println(\"THIS IS THE ARRAYS SORTED AND TIMES FOR THE ARRAY OF 200 ELEMNTS\");
//THIS IS THE INSERTION SORT OF THE 200 ELEMENT ARRAY
SortClass insertionArray200 = new SortClass(Array200,200);
insertionArray200.insertionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE SELECTION SORT OF THE 200 ELEMENT ARRAY
SortClass selectioArray200 = new SortClass(Array200,200);
selectioArray200.selectionSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//**************************Merge Sort
//THIS IS THE MERGE SORT OF THE 200 ELEMENTS ARRAY
SortClass mergeArray200 = new SortClass(Array200, 200);
mergeArray200.mergeSortandTimer();
System.out.println(\" \");
System.out.println(\" \");
//THIS IS THE QUICK SORT OF THE 200 ELEMENTS ARRAY
//**************************
SortClass quickArray200 = new SortClass(Array200, 200);
quickArray200.quickSortandTimer();
//COMPARISON TIME
System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 20 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray20.time);
System.out.println(\"Selection Sort \"+selectionArray20.time);
System.out.println(\"Merge Sort \"+mergeArray20.time);
System.out.println(\"Quick Sort \"+quickArray20.time);
System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 100 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray100.time);
System.out.println(\"Selection Sort \"+selectioArray100.time);
System.out.println(\"Merge Sort \"+mergeArray100.time);
System.out.println(\"Quick Sort \"+quickArray100.time);
System.out.println(\"Times of the Sorting Methods\");
System.out.println(\"*** 200 Element sorting times***\");
System.out.println(\"Insertion Sort \"+insertionArray200.time);
System.out.println(\"Selection Sort \"+selectioArray200.time);
System.out.println(\"Merge Sort \"+mergeArray200.time);
System.out.println(\"Quick Sort \"+quickArray200.time);
}
}

class SortClass{
int [] Mainarray;
int [] temparray;
int size;
long time;
public SortClass(int array[],int size1){
size = size1;
Mainarray= array.clone();
temparray = new int[size1];
time = 0;
}
void insertionSort() {
for (int i=0; i<size;i++) {
int key = Mainarray[i];
int j = i - 1;
while (j > -1 && (Mainarray[j] > key)) {
Mainarray[j + 1] = Mainarray[j];
j--;
}
Mainarray[j + 1] = key;
}
}
void insertionSortandTimer(){
final long starttime = System.nanoTime();
insertionSort();
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Insertion Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+ \" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;
print();
}
void print() {
for(int i =0;i<Mainarray.length;i++){
System.out.print(\"Mainarray [\"+(i+1)+\"]\"+Mainarray[i] +\" \");
}
}
void selectionsort(){
for(int i = 0;i<Mainarray.length;i++)
{
int min = i;
for(int j = i + 1;j<Mainarray.length;j++)
{
if(Mainarray[j] < Mainarray[min]) { min = j;}
}
int temp = Mainarray[i];
Mainarray[i] = Mainarray[min];
Mainarray[min] = temp;
}

}
void selectionSortandTimer(){
final long starttime = System.nanoTime();
selectionsort();
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Selection Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+\" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;
print();
}
//*** Merge sort and quick sort

private void mergesort(int lowerIndex, int higherIndex) {
  
if (lowerIndex < higherIndex) {
int middle = lowerIndex + (higherIndex - lowerIndex) / 2;
// Below step sorts the left side of the array
mergesort(lowerIndex, middle);
// Below step sorts the right side of the array
mergesort(middle + 1, higherIndex);
// Now merge both sides
mergeParts(lowerIndex, middle, higherIndex);
}
}

void mergeParts(int lowerIndex, int middle, int higherIndex) {

for (int i = lowerIndex; i <= higherIndex; i++) {
   temparray[i] = Mainarray[i];
}
int i = lowerIndex;
int j = middle + 1;
int k = lowerIndex;
while (i <= middle && j <= higherIndex) {
if (temparray[i] <= temparray[j]) {
   Mainarray[k] = temparray[i];
i++;
} else {
   Mainarray[k] = temparray[j];
j++;
}
k++;
}
while (i <= middle) {
   Mainarray[k] = temparray[i];
k++;
i++;
}

}

void mergeSortandTimer(){
final long starttime = System.nanoTime();
mergesort(0,Mainarray.length-1);
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Merge Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+\" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;
print();
}

void quicksort(int lowerIndex, int higherIndex) {
  
int i = lowerIndex;
int j = higherIndex;
// calculate pivot number, I am taking pivot as middle index number
int pivot = Mainarray[lowerIndex+(higherIndex-lowerIndex)/2];
// Divide into two arrays
while (i <= j) {
/**
* In each iteration, we will identify a number from left side which
* is greater then the pivot value, and also we will identify a number
* from right side which is less then the pivot value. Once the search
* is done, then we exchange both numbers.
*/
while (Mainarray[i] < pivot) {
i++;
}
while (Mainarray[j] > pivot) {
j--;
}
if (i <= j) {
exchangeNumbers(i, j);
//move index to next position on both sides
i++;
j--;
}
}
// call quickSort() method recursively
if (lowerIndex < j)
   quicksort(lowerIndex, j);
if (i < higherIndex)
   quicksort(i, higherIndex);
}

private void exchangeNumbers(int i, int j) {
int temp = Mainarray[i];
Mainarray[i] = Mainarray[j];
Mainarray[j] = temp;
}

void quickSortandTimer(){
final long starttime = System.nanoTime();
quicksort(0,Mainarray.length-1);
final long endtime = System.nanoTime();
final long totaltime = (endtime - starttime);
System.out.println(\"**Quick Sort for Array with \"+Mainarray.length+\" elements **\");
System.out.println(\"This is the start time = \"+ starttime+\" This is the end time = \"+ endtime);
System.out.println(\"This is the time elapsed from start to finished = \"+ totaltime);
time = totaltime;
print();
}

}