Algorithms

Implement the following in the pictures attached ,

This is the starter code

import java.util.Comparator;
import java.util.List;

public class Sorting {

public static <T extends Comparable<T>> void bogoSort(final List<T> list, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void bogoSort(final T[] array, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void bubbleSort(final List<T> list, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void bubbleSort(final T[] array, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void selectionSort(final List<T> list, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void selectionSort(final T[] array, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void mergeSort(final List<T> list, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void mergeSort(final T[] array, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void quickSort(final List<T> list, final Comparator<T> comparator) {
// TODO
}

public static <T extends Comparable<T>> void quickSort(final T[] array, final Comparator<T> comparator) {
// TODO
}
}