1. public static void sort(int array[]) {
    2.     megerSort(array, 0, array.length - 1);
    3. }
    5. public static void megerSort(int data[], int left, int right) {
    6.     if (left < right) {
    7.         int mid = (left + right) / 2;
    8.         megerSort(data, left, mid);
    9.         megerSort(data, mid + 1, right);
    10.         meger(data, left, mid, right);
    11.     }
    12. }
    14. public static void meger(int data[], int left, int mid, int right) {
    15.     int temp[] = new int[data.length];
    16.     int point1 = left;
    17.     int point2 = mid + 1;
    18.     int loc = left;
    19.     while (point1 <= mid && point2 <= right) {
    20.         if (data[point1] < data[point2]) {
    21.             temp[loc++] = data[point1++];
    22.         } else {
    23.             temp[loc++] = data[point2++];
    24.         }
    25.     }
    26.     while (point1 <= mid) {
    27.         temp[loc++] = data[point1++];
    28.     }
    29.     while (point2 <= right) {
    30.         temp[loc++] = data[point2++];
    31.     }
    32.     for (int i = left; i <= right; i++) {
    33.         data[i] = temp[i];
    34.     }
    35. }