package test.com.li;
import java.util.Arrays;
public class MergeSort<E extends Comparable<? super E>> {
public void mergeSort(E[] a, E[] tmpArray, int left, int right) {
if (left < right) {
int center = (left + right) / 2;
mergeSort(a, tmpArray, left, center);
mergeSort(a, tmpArray, center + 1, right);
merge(a, tmpArray, left, center + 1, right);
}
}
public void merge(E[] a, E[] tmpArray, int left, int rightPos, int right) {
int tmpPost = left;
int leftEnd = rightPos - 1;
int elements = right - left + 1;
while (left <= leftEnd && rightPos <= right) {
if (a[left].compareTo(a[rightPos]) <= 0)
tmpArray[tmpPost++] = a[left++];
if (a[left].compareTo(a[rightPos]) > 0)
tmpArray[tmpPost++] = a[rightPos++];
}
while (left <= leftEnd)
tmpArray[tmpPost++] = a[left++];
while (rightPos <= right)
tmpArray[tmpPost++] = a[rightPos++];
for (int i = 0; i < elements; i++, right--)
a[right] = tmpArray[right];
}
public void megeSort(E[] a) {
E[] tmpArray = (E[])new Comparable[a.length];
mergeSort(a, tmpArray, 0, a.length-1);
}
public static void main(String[] args) {
Integer[] a = new Integer[] {1,2,5,10,20,3,6};
MergeSort mergeSort =new MergeSort();
mergeSort.megeSort(a);
System.out.println(Arrays.toString(a));
}
}