排序都有哪几种方法？请列举。用JAVA实现一个快速排序。

本人只研究过冒泡排序、选择排序和快速排序，下面是快速排序的代码：

public class QuickSort {
/**
* 快速排序
*@param strDate
*@param left
*@param right
*/
publicvoid quickSort(String[] strDate,int left,int right){
Stringmiddle,tempDate;
inti,j;
i=left;
j=right;
middle=strDate[(i+j)/2];
do{
while(strDate[i].compareTo(middle)<0&&i<right)
i++; //找出左边比中间值大的数
while(strDate[j].compareTo(middle)>0&&j>left)
j--; //找出右边比中间值小的数
if(i<=j){//将左边大的数和右边小的数进行替换
tempDate=strDate[i];
strDate[i]=strDate[j];
strDate[j]=tempDate;
i++;
j--;
}
}while(i<=j);//当两者交错时停止

if(i<right){
quickSort(strDate,i,right);//从
}
if(j>left){
quickSort(strDate,left,j);
}
}
/**
  * @param args
  */
publicstatic void main(String[] args){
String[]strVoid=newString[]{"11","66","22","0","55","22","0","32"};
QuickSortsort=new QuickSort();
sort.quickSort(strVoid,0,strVoid.length-1);
for(inti=0;i<strVoid.length;i++){
System.out.println(strVoid[i]+"");
}
}


}

 

 

冒泡排序

package thread2;

 

public class SortTest {

 

   public void sort(int[] args) {

      for (int m : args) {

         System.out.println("排序前 " + args[m] + " ");

      }

 

      int time1 = 0, time2 = 0;

      for (int i = 0; i < args.length - 1; i++) {

         ++time1;

 

         for (int j = i + 1; j < args.length; j++) {

            ++time2;

            int temp;

            if (args[i] > args[j]) {

                temp = args[j];

                args[j] = args[i];

                args[i] = temp;

            }

         }

      }

 

      System.out.println();

      System.out.println("外循环次数: " + time1 + " 内循环次数: " + time2);

      for (int n : args) {

         System.out.println("排序后" + n + " ");

      }

   }

 

   public static void main(String[] args) {

      int[] arg = new int[] { 2, 1, 4, 5, 8, 7, 6, 3, 9, 0 };

 

      new SortTest().sort(arg);

   }

}

选择排序

package thread2;

 

public class Select {

 

   public static void main(String[] args) {

      int[] values = { 5, 2, 4, 1, 3 };

      sort(values);

   }

 

   public static void sort(int[] values) {

      int temp = 0;

      int offset = 0;

      for (int i = 0; i < values.length; i++) {

         temp = values[i];

         offset = 0;// offset指到每一次排序中最小元素的位置

 

         for (int j = i + 1; j < values.length; j++) {

            if (temp > values[j]) {

                temp = values[j];

                offset = j;

            }

         }

 

         if (offset > i) {

            values[offset] = values[i];

            values[i] = temp;

         }

 

         System.out.println("第" + (i + 1) + "次: ");

         for (int k = 0; k < values.length; k++) {

            System.out.print(values[k] + ",");

         }

         System.out.println("");

      }

   }

}