JAVA一个快速排序实现代码

packagecom.itheima;

/**

 * 4、 排序有哪几种方法？请列举。并用JAVA实现一个快速排序.

 * 排序的方法有：冒泡排序、快速排序、选择排序、插入排序。。。

 *

 * @author 281167413@qq.com

 */

publicclassTest4 {

    staticintcount =0;

    publicstaticvoidmain(String[] args) {

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

        qsort(values,0, (values.length -1));

        System.out.printf("nn排序后的结果是：");

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

            System.out.printf("%d ", values[i]);

        }

    }

    publicstaticvoidqsort(intvalues[],intleft,intright) {

        inttmp =0;

        System.out.printf("n这个是第%d次排序的结果：", count);

        count++;

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

            System.out.printf("%d ", values[i]);

        }

        if(left < right) {

            tmp = partition(values, left, right);

            qsort(values, left, tmp);

            qsort(values, tmp +1, right);

        }

    }

    publicstaticintpartition(intvalues[],intleft,intright) {

        inti =0, j =0;

        intkey =0, tmp =0;

        if(null== values) {

            return0;

        }

        i = left;

        j = right;

        key = values[left];

        // 这个while循环可以实现排序的第一步：分组

        while(i < j) {

            while(values[j] > key) {

                --j;

            }

            tmp = values[i];

            values[i] = values[j];

            values[j] = tmp;

            while(values[i] < key) {

                i++;

            }

            tmp = values[i];

            values[i] = values[j];

            values[j] = tmp;

        }

        returni;

    }

}