mergeSort

package basicLearning;
import java.util.Random;
public class MergeSort {
    static int n;
    static int[] q;
    static int[] tmp;
    public static void main(String[] args){
        n = 100;
        q = new int[n];
        tmp = new int[n];
        Random r = new Random();
        int seed = n*10;

        for(int i = 0; i < n; ++i)
            q[i] = r.nextInt(seed);
        mergeSort(0,n - 1);
        for(int i = 0; i < n; ++i) {
            if((i+1) % 20 == 0)
                System.out.printf("\n");
            System.out.printf("%d ", q[i]);
        }
    }

    public static void mergeSort(int l , int r){
        if (l >= r) return;

        int mid = l + r >> 1;

        mergeSort( l, mid);
        mergeSort( mid + 1, r);

        int k = 0, i = l, j = mid + 1;
        while (i <= mid && j <= r)
            if (q[i] <= q[j]) tmp[k ++ ] = q[i ++ ];
            else tmp[k ++ ] = q[j ++ ];
        while (i <= mid) tmp[k ++ ] = q[i ++ ];
        while (j <= r) tmp[k ++ ] = q[j ++ ];

        for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = tmp[j];

    }
}

留档