归并排序Java实现

 package mergeSort;

import java.util.Random;
import java.util.Scanner;

public class MergeSort {
 private static int n = 0;
 private static int[] array = null;
 private static int[] b = null;
 
 public MergeSort() {
 }
 
 public static void main(String[] args) {
  System.out.println("请输入比较的数的个数n: ");
  Scanner sc = new Scanner(System.in);
  n = sc.nextInt();
  MergeSort.array = new int[n];
  MergeSort.b = new int[n];
  Random r = new Random();
  for(int i=0; i<n;) {
   array[i] = r.nextInt(6000);
   i++;
   /*System.out.print(array[i] + "  ");
   if(i%10 == 0) {
    System.out.println();
   }*/
  }
  long t = System.currentTimeMillis();
  mergeSort(array, 0, n-1);
  System.out.println("排序所用时间为： " + (System.currentTimeMillis() - t) + "ms");
  //System.out.println("排序后的数如下：");
  /*for(int i=0; i<n;) {
   System.out.print(array[i] + "  ");
   i++;
   if(i%10 == 0) {
    System.out.println();
   }
  }*/
  
 }
 
 
 public static void mergeSort(int a[], int left, int right) {
  int i = 0;
  if(left < right) {
   i = (left + right)/2;
   mergeSort(a, left, i);
   mergeSort(a, i+1, right);
   merge(a, b, left, i, right);
   copy(a, b, left, right);
  }
  
 }
 
 public static void merge(int[] a, int[] b, int left, int i, int right) {
  int j=left,k=i+1,p=0;
  for(; j<=i && k<=right;) {
   if(a[j] > a[k]) {
    b[p++] = a[j++];
   } else {
    b[p++] = a[k++];
   }
  }
  for(; j<=i; p++,j++){
   b[p] = a[j];
  }
  for(; k<=right;) {
   b[p++] = a[k++];
  }
 }

 public static void copy(int[] a, int[] b, int left, int right) {
  for(int i=0, j=left; j<=right; j++,i++) {
   a[j] = b[i];
  }
 }

 public static void setArray(int[] array) {
  MergeSort.array = array;
 }

 public static int[] getArray() {
  return array;
 }

 public static void setB(int[] b) {
  MergeSort.b = b;
 }

 public static int[] getB() {
  return b;
 }
}