快速排序，归并排序Java实现

快速排序

public class Quicksort {
	
	public static int oneSort(int start, int end, int[] arr) {
		
		int p = arr[start];
		int ri = start;
		int le = end;
		
		while(le>ri) {
			
			while(arr[le]>p && ri<le) {
				le--;
			}
			arr[ri] = arr[le];
			while(arr[ri]<p && ri<le) {
				ri++;
			}
			arr[le] = arr[ri];
		}
		arr[ri] = p;
		return ri;
	}
	
	public static void quickSort(int start, int end, int[] arr) {
		
		if(end>start) {
			int p = oneSort(start, end, arr);
			quickSort(start,p,arr);
			quickSort(p+1,end,arr);
			
		}
	}
	
	
	public static void main(String[] args) {
		int[] array = {31,33,27,15,42,11,40,5,19,21};
		quickSort(0,array.length-1,array);
		
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]+" ");
		}
	}
}

归并排序

public class Mergesort {
	
	public static void oneMerge(int start,int end,int mid,int[] arr) {
		
		int poi = start;
		int p1 = start;
		int p2 = mid+1;
		int[] reArr = new int[arr.length]; 
		while(p1<=mid&&p2<=end) {
			if(arr[p1]<arr[p2]) {
				reArr[poi] = arr[p1];
				p1++;
			}
			else {
				reArr[poi] = arr[p2];
				p2++;
			}
			poi++;
		}
		
		while(p1<=mid) {
			reArr[poi] = arr[p1];
			poi++;
			p1++;
		}
		while(p2<=end) {
			reArr[poi] = arr[p2];
			poi++;
			p2++;
		}
		poi = start;
		while(poi<=end) {
			arr[poi] = reArr[poi];
			poi++;
		}
	}
	
	
	public static void mergeSort(int start,int end, int[] arr) {
		
		if (end-start>1) {
			int mid = (start+end)/2;
			mergeSort(start, mid, arr);
			mergeSort(mid+1, end, arr);
			oneMerge(start,end,mid,arr);
		}
	}
	
	public static void main(String[] args) {
		int[] array = {31,33,27,15,42,11,40,5,19,21};
		mergeSort(0, array.length-1, array);
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]+" ");
		}
	}
}