Please solve it using Eclipse JAVA-SE13

Urgent!!!!

Sorting:

import java.util.Random;

public class Sorting {

public static void main(String[] args) { // TODO Auto-generated method stub int n=1000; int x[]= new int [n]; Random r = new Random(); for(int i=0;i 0; outer--) { // counting down boolean sorted=true; for (inner = 0; inner a[inner + 1]) { // if out of order... int temp = a[inner]; // ...then swap a[inner] = a[inner + 1]; a[inner + 1] = temp; sorted=false; counterswap++; } } if(sorted) return; } System.out.println("BubbleSort Swap"+counterswap); }<>

public static void selectionSort(int[] a) { int outer, inner, min; for (outer = 0; outer a[min]) min = inner; int temp = a[outer]; a[outer] = a[min]; a[min] = temp;

} } public static void insertionSort(int[] a) { int inner,outer; for (outer =1; outer 0 && a[inner - 1] >= temp) { a[inner] = a[inner - 1]; inner--; } a[inner] = temp;

} } }

Sorting String: public class SortingString {

public static void main(String[] args) { // TODO Auto-generated method stub

} public static void bubbleSort(String[] a) { int outer, inner; int counterswap=0; for (outer = a.length - 1; outer > 0; outer--) { // counting down boolean sorted=true; for (inner = 0; inner 0) { // if out of order... String temp = a[inner]; // ...then swap a[inner] = a[inner + 1]; a[inner + 1] = temp; sorted=false; counterswap++; } } if(sorted) return; } System.out.println("BubbleSort Swap"+counterswap); } }

1. With reference to lab 6, assume you have class Student that has id (int), name(String), gpa(double), update the sorting algorithms covered to receive an array of students, and sort them based on the gpa. Test the 3 sorting algorithms in the main