归并排序快速排序java代码

package com.bin.sort;

import java.util.Random;

public class QuickSort {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] array = getArrya(10);
		int[] array2 = new int[array.length];
		//quickSort(array, 0, array.length-1);
		mergeSort(array, 0, array.length-1, array2);
		for(int i:array){
			System.out.print(i+" ");
		}

	}
	
	/**快速排序
	 * @param array
	 * @param start
	 * @param end
	 */
	public static void quickSort(int[] array,int start,int end){
		if(start>=end){
			return;
		}else{
			int k= array[start];
			int i=start;
			int j=end;
			while(i<j){
				while(i<j && array[j]>=k){
					j--;
				}
				array[i]=array[j];
				while(i<j && array[i]<=k){
					i++;
				}
				array[j]=array[i];
				
			}
			array[i]=k;
			
			
			quickSort(array, start, i-1);
			quickSort(array, i+1, end);
			
		}
	}
	
	
	/**归并排序
	 * @param array
	 * @param start
	 * @param end
	 * @param array2
	 */
	public static void mergeSort(int[] array,int start,int end,int[] array2){
		if(start>=end){
			return ;
		}else{
			int mid = (start+end)/2;
			mergeSort(array, start, mid, array2);
			mergeSort(array, mid+1, end, array2);
			merge(array, start, mid, end, array2);
		}
	}
	
	
	/**合并数组
	 * @param array
	 * @param start
	 * @param mid
	 * @param end
	 * @param array2
	 */
	public static void merge(int[] array,int start,int mid,int end,int[] array2){
		int i=start;
		int j=mid+1;
		int k=i;
		
		while(i<=mid && j<=end ){
			if(array[i]<array[j]) array2[k++]=array[i++];
			else array2[k++] = array[j++];
		}
		while(i<=mid) array2[k++]=array[i++];

		while(j<=end) array2[k++] = array[j++];
		
		for(i=start;i<=end;i++){
			array[i]=array2[i];
		}
		
		
	}
	
	
	
	/**产生随机数组
	 * @param n
	 * @return
	 */
	public static int[] getArrya(int n){
	 Random rd = new Random();
	 int max = 10*n;
	 int[] array = new int[n];
	 for(int i=0;i<n;i++){
	 array[i]=rd.nextInt(max);
	 System.out.print(array[i]+" ");
	 }
	 System.out.println();
	 return array;
	 }

}