排序算法：冒泡、快排

冒泡排序

public static void main(String[] args) {
		int[] arr = {8,2,5,7,5,3,9};
		for(int i=1;i<arr.length;i++) {
			for(int k=0;k<arr.length-i;k++) {
				if(arr[k]>arr[k+1]) {
					int tmp = arr[k];
					arr[k] =arr[k+1];
					arr[k+1] = tmp;
				}
			}
		}
		System.out.println(Arrays.toString(arr));
	}

快速排序

public static void main(String[] args) {
			int[] arr=new int[] {3,7,1,8,10,6,5,3,7,9};
			quickSort(arr, 0, arr.length-1);
			for(int tmp:arr) {
				System.out.print(tmp+"\t");
			}
		}		
		public static void quickSort(int[] arr,int start,int end) {
			if(start<end) {
				int pivot=arr[start];
				int low=start;
				int high=end;
				
				while(low<high) {
					while(low<high && arr[high]>=pivot) {
						high--;
					}
					arr[low]=arr[high];
					while(low<high && arr[low]<=pivot) {
						low++;
					}
					arr[high]=arr[low];
				}
				
				arr[low]=pivot;
				quickSort(arr, start, low);
				quickSort(arr, low+1, end);
			}
		}