浅析java快速排序算法

package com.zc.manythread;
import java.util.Random;
/**
* 快速排序
* @author Administrator
*
*/
public class QSort {
   int [] date;
   public QSort(int[] date) {
       this.date=date;
   }
   /**
    * 交换函数
    * @param a
    * @param i
    * @param j
    */
   private void swap(int a[],int i,int j) {
       int T;
       T=a[i];
       a[i]=a[j];
       a[j]=T;
   }
   /*******************
    * 排序函数
    * @param a
    * @param lo0
    * @param hi0
    * @return
    */
   int[] QuickSort(int a[],int lo0,int hi0){//分治法，作用就是将数组分为A[lo0..q-1] 和A[q+1..hi0] 
       int lo=lo0;
       int hi=hi0;
       int mid;
       if (hi0>lo0) {
           mid=a[(hi0+lo0)/2];
           while(lo<=hi){
               while((lo<hi0)&&(a[lo]<mid))  ++lo;
               while((hi>lo0)&&(a[hi]>mid))  --hi;
               if (lo<=hi) {
                   swap(a,lo,hi);
                   ++lo;
                   --hi;
               }
           }
           if (lo0<hi) {
               QuickSort(a, lo0, hi);
           }
           if (lo<hi0) {
               QuickSort(a, lo, hi0);
           }
       }
       return a;
   }
   /**************
    *
    * 创建有重复数组数据
    * *****************/
   private static int[]  createDate(int count) {
       int[] data=new int[count];
       for (int i = 0; i < data.length; i++) {
           data[i]=(int)(Math.random()*count);
       }
       return data;
   }
   /**
    * 无重复数组数据
    * @param count
    * @return
    */
   private static int[]  createDate1(int count) {
       int[] data=new int[count];
         Random rand = new Random();
         boolean[] bool = new boolean[100];
         int num = 0;
         for (int i = 0; i < count; i++) {
          do {
           // 如果产生的数相同继续循环
           num = rand.nextInt(100);
          } while (bool[num]);
          bool[num] = true;
          data[i]=num;
         }
         return data;
   }
   /**************主函数*****************/
   public static void main(String[] args) {
       final int count=10;
       int[] data=createDate1(count);
       for (int n:data) {
           System.out.print(n+"\t");
       }
       QSort data1=new QSort(data);
       System.out.println();
       int[] a=data1.QuickSort(data,0, count-1);
       for (int n:a) {
           System.out.print(n+"\t");
       }
   }
}