JAVA快速排序

冒泡排序：public class A public static void main(String args) int values = 3, 1, 6, 2, 9, 0, 7, 4, 5 ;sort(values);for (int i = 0; i values.length; +i) System.out.println(Index: + i + Value: + valuesi);public static void sort(int values) int temp;for (int i = 0; i values.length; +i) for (int j = 0; j valuesj + 1) temp = valuesj;valuesj = valuesj + 1;valuesj + 1 = temp;归并排序：快速排序时间复杂度下界为O(nlogn)，最坏情况为O(n2)。归并排序 nlogn归并算法：public void MergerSort(int v, int first, int last) if (first + 1 last) int mid = (first + last) / 2; MergerSort(v, first, mid); MergerSort(v, mid, last); Merger(v, first, mid, last); public void Merger(int v, int first, int mid, int last) Queue tempV = new Queue(); int indexA, indexB; /设置indexA，并扫描subArray1 first,mid /设置indexB,并扫描subArray2 mid,last indexA = first; indexB = mid; /在没有比较完两个子标的情况下，比较 vindexA和vindexB /将其中小的放到临时变量tempV中 while (indexA mid & indexB last) if (vindexA vindexB) tempV.Enqueue(vindexA); indexA+; else tempV.Enqueue(vindexB); indexB+; /复制没有比较完子表中的元素 while (indexA mid) tempV.Enqueue(vindexA); indexA+; while (indexB 0) vfirst+index = tempV.Dequeue(); index+; 快速排序：public class A public static void quicksort(int stru, int left, int right) if(leftright)int i=left,j=right;int X=strui;int n=i;while(ij)while(Xi)j-;strun=struj;n=j;while(Xstrui & ij)i+;strun=strui;n=i;strui=X;quicksort(stru,left,j-1); / 对左边进行递回quicksort(stru,j+1,right); / 对右边进行递回public static void main(String args) / TODO Auto-generated method stubint stru=49,38,65,97,13,27;System.out.println(快速排序之前：);for(int k=0;kstru.length;k+)System.out.print(struk+ );quicksort(stru,0,stru.length-1);System.out.println(n快速排序之后：);for(int k=0;kstru.length;k+)System.out.print(struk+ );