蓉儿的博客

快速排序的算法：以s[l]为基准，从r,从右向左比较，找到比s[l]小的就放到s[i],从l,从左向右比较，找到比s[l]大的就放到s[j]如此递归public class quickSort { static void quickSortM(int[] s, int l, int r){ if (l < r){ int x = s[l]; int i = l,j = r;

以s[l]为基准，从右向左比较，找到比它小的就放到s[i]从左向右比较，找到比它大的就放到s[j],当i==j时，退出循环，s[i]=x时间复杂度是nlognpublic class quickSort { static void quickSortM(int[] s, int l, int r){ if (l < r){ int x = s[l]; int i =

冒泡排序的原理就是每个元素一轮一轮的去与相邻的元素作比较，附上源码public class test1 {static String[] unsorted = {"B","C","A","F","E","H","G"};public static void main(String[] args){ int i,j; String temp; int len = unsorted.le