冒泡排序-->快速排序

交换排序类：冒泡排序：复杂度O(n^2);

最好情况：O(n)

最坏情况：O(n) 

稳定

public class BubbleSort1 {

	static int[] sqlist = {0,9,8,7,5,6,4,3,2,1,12,23,11};
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		bublesort2(sqlist);
		for (int i = 0; i < sqlist.length; i++) {
			System.out.print(sqlist[i]+" ");
		}
	}
	
	/*升序排列,降序排列就改成大于号，让最小的冒泡
	 * 挨个挨个交换，把最大的交换到最后一个，然后从头交换，把次大的交换到倒数第二个*/
	public static void bublesort1(int[] sqlist) {
		for (int i = 0; i < sqlist.length; i++) {
			for (int j = 1; j < sqlist.length-i; j++) {
				if (sqlist[j]<sqlist[j-1]) {
					swap(sqlist, j, j-1);
				}
			}
		}
	}
	
	/*改进冒泡:避免在有序的情况下继续循环判断*/
	public static void bublesort2(int[] sqlist) {
		boolean flag = true;
		for (int i = 0; i < sqlist.length&&flag; i++) {
			flag=false;
			for (int j = 0; j < sqlist.length-i-1; j++) {
				if (sqlist[j]>sqlist[j+1]) {
					swap(sqlist, j, j+1);
					flag=true;
				}
			}
		}
	}

	
	private static void swap(int[] sqlist,int i,int j) {
		int temp = sqlist[i];
		sqlist[i] = sqlist[j];
		sqlist[j] = temp;
	}
}

快速排序：抓扑克牌的时候一把抓起来，比第一张小的放它左边，比它大的放右边；依次。。

平均情况：O(nlogn)

最好:O(nlogn)

最坏：O(nlogn)

不稳定

public class QuickSort {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
//		int[] sqlist = {0,9,8,7,5,6,4,3,2,1,12,23,11};
		int[] sqlist = {0,50,10,90,30,70,40,80,60,20};
		quicksort(sqlist,1,sqlist.length-1);
		System.out.print("排序后：");
		for (int i = 1; i < sqlist.length; i++) {
			System.out.print(sqlist[i]+" ");
		}
	}

	private static void quicksort(int[] sqlist, int low, int high) {
		// TODO Auto-generated method stub
		int pivot;//比较关键字所在位置下标
//		if(low<high){
//			pivot = partition(sqlist,low,high);//分割函数
//			quicksort(sqlist, low, pivot-1);
//			quicksort(sqlist, pivot+1, high);
//		}
		//替换成尾递归的形式，可以减少栈的消耗；特别是面对排序列划分极端不平衡时
		while (low<high) {
			pivot = partition(sqlist,low,high);//分割函数
			quicksort(sqlist, low, pivot-1);
			low=pivot+1;
		}
	}

	//返回pivot所在位置；分割pivot之前和之后有序；
	private static int partition(int[] sqlist, int low, int high) {
		// TODO Auto-generated method stub
		int pivotnum = sqlist[low];//比较关键字的值取该端的第一个；
		sqlist[0] = sqlist[low];
		while (low<high) {
			while (low<high&&pivotnum<=sqlist[high]) {
				high--;
			}
//			swap(sqlist, low, high);//这一步换成下一句，减少了多次交换数据的过程；
			sqlist[low] = sqlist [high];
			while (low<high&&sqlist[low]<=pivotnum) {
				low++;
			}
//			swap(sqlist, low, high);
			sqlist[high]=sqlist[low];
		}
		sqlist[low]=sqlist[0];
		return low;
	}

	private static void swap(int[] sqlist,int i,int j) {
		int temp = sqlist[i];
		sqlist[i] = sqlist[j];
		sqlist[j] = temp;
	}
}