How do I implement the following sorts in Java using the generic data type E and the comparator's compare(E o1, E o2) method?

public void heapSort(E[] data, Comparator super E> compare); public void mergeSort(E[] data, Comparator super E> compare); public void quickSort(E[] data, Comparator super E> compare); 

public void insertionSort(E[] data, Comparator super E> compare); public void bubbleSort(E[] data, Comparator super E> compare); public void selectionSort(E[] data, Comparator super E> compare);