java实现快速排序

public static void quickSort(int[]a){
        quickQuickSort(a,0,a.length-1,0);
        getP(a);
    }
    public static void quickQuickSort(int[]a , int start, int end,int target_index){
        int st = start;
        int en = end;
        while(st=st;i--){
                if(a[en] > a[target_index]){
                    en--;continue;
                }
                for(int j=st;j<=en; j++){
                    if(a[st] <= a[target_index] && st != en){
                        st++;continue;
                    }
                    if(st == en && a[st]<=a[target_index]){
                        swap(a,target_index,en);
                        target_index = st;
                    }else{
                        swap(a,st,en);
                    }
                    break;
                }
                break;
            }
        }
        if(end>target_index+1){
            quickQuickSort(a,target_index+1,end,target_index+1);
        }
        if(target_index-1>start){
            quickQuickSort(a,start,target_index-1,start);
        }
    }
    public static void swap (int[]a , int s, int e){
        int m = a[s];
        a[s] = a[e];
        a[e] = m;
    }
    public static void getP(int[] a){
        for(int m : a){
            System.out.print(m+" ");
        }
        System.out.println();
        System.out.println("--------------------");
    }