Language is Java
Assignment: Create a merge sort, count sort, andselection sort that incorporates a String and Integer Comparator(Attempted code located at bottom of question)
public interface Sorting {
public abstract void sort(T[] array,boolean ascending);
public default void swap(T array[],inti,int j)
{
T tmp =array[i];
array[i] =array[j];
array[j] =tmp;
}
public default void print(T array[])
{
for(Tval:array)
{
System.out.print(val.toString()+””);
}
System.out.println();
}
}
public interface Comparator<E> {
public boolean comparison(E x, E y, boolean ascending);
}
public class SelectionSort<T> implementsSorting<T> {
private Comparator<T> comparator;
public SelectionSort(Comparator<T> comparator) {
// TO DO
}
@Override
public void sort(T[] array, boolean ascending) {
//TO DO
}
}
public class MergeSort implements Sorting {
private Comparator comparator;
public MergeSort(Comparator comparator) {
// TO DO
}
@Override
public void sort(T[] array, booleanascending) {
// TO DO
}
}
public class CountSort implements Sorting {
private
PayPal Gateway not configured
PayPal Gateway not configured