Java程序设计（快速排序）

import java.util.Arrays;
public class shuzukuaipai{
    public static void main(String[] args) {
        /*快速排序*/
        int[] arr={9,6,8,34,56,13,45,76,40};
        QuaiPai(arr,0,arr.length-1);
        System.out.println(Arrays.toString(arr));
    }
    public static void QuaiPai(int[] arr,int left,int right) {
        if(left>=right){
            return;
        }
        int left0=left;
        int baseNumber = arr[left0];
        while (left != right) {
            System.out.println(right);
            while(arr[right]>=baseNumber && left<right){
                right--;
            }
            System.out.println("--------------");
            System.out.println(left);
            while(arr[left]<=baseNumber && left<right){
                left++;
            }
            int tmp=arr[right];
            arr[right]=arr[left];
            arr[left]=tmp;
        }
        int tmp=arr[left0];
        arr[left0]=arr[left];
        arr[left]=tmp;
        QuaiPai(arr,left+1,arr.length-1);
        QuaiPai(arr,left0,right-1);
    }
}

运行结果：