快速排序

/**
 * 快速排序
 */
public class QuickSort {
    public  void quickSort(int [] a,int low, int high){
        if (low=a[low]){
                low++;
            }
            a[high] = a[low];
        }
        a[low] = tmp;
        return low;
    }
    public static void main(String[] args) {
        QuickSort q = new QuickSort();
        int[] a ={55,33,11,8,333,52,88,99,66,0,4,8};
        if(a.length>0){
            q.quickSort(a,0,a.length-1);
        }
        System.out.println(Arrays.toString(a));
    }
}