aassdd_zz的专栏

/**   * 冒泡算法（从大向小）   * 冒泡方向是 从左向右   *   * @param iArgs   * @return   */  public static int[]  getBubbleSort(int[] iArgs) {   int[] iTempArgs = iArgs;   boolean flag = true; //数组是否已经是最好情况

package com.zz.sort; import java.util.Random; public class QuickSort { public static void main(String[] args) { // int[] iArgs = new int[]{72,6,57,88,60,42,83,73,48,85}; int iLeng

package com.zz.sort; import java.util.Random; public class SelectionSort { public static void main(String[] args) { int iLength = 1000; int[] iArgs = new int[iLength]; for(int i = 0

package com.zz.sort; import java.util.Random; public class HeapSort { /** * @param args */ public static void main(String[] args) { int iLength = 5000; int[] iArgs = new int

package com.zz.sort; import java.util.Random; public class ShellSort { public static void main(String[] args) { //int[] iArraya = new int[]{10,1,8,54,23,51,15}; int iLong = 1000; int[

package com.zz.sort; import java.util.Random; public class MergeSortZZ { public static void main(String[] args) { //int[] iArrgs = new int[] { 10, 3, 18, 3, 5, 8, 16, 4, 2 }; int iLength

package com.zz.sort; public class Compare2Arrag { /** * 两个数组按大小顺序排列 * * @param args */ public static void main(String[] args) { //数组一和数组二必须是排序好的 int[] oneArrags = new int[]{1