欢迎使用CSDN-markdown编辑器

最新推荐文章于 2021-01-07 23:01:28 发布

footprint_of_learn

最新推荐文章于 2021-01-07 23:01:28 发布

阅读量181

点赞数

分类专栏：数据结构与算法文章标签：排序

本文链接：https://blog.csdn.net/qq_22989831/article/details/46829181

版权

数据结构与算法专栏收录该内容

1 篇文章 0 订阅

订阅专栏

public class QSort {
void quickSort (int[] r) {
qSort(r, 1, r.length -1);
}

void qSort(int[] r, int low, int high) {
    int pivot;
    if(low < high) {
        pivot = partition (r, low, high);
        qSort(r, low, pivot - 1);
        qSort(r, pivot + 1, high);
    }
}

int partition (int[] r, int low, int high) {
    int pivotKey;
    pivotKey = r[low];
    while (low < high) {
        while(low < high && r[high] >= pivotKey) {
            high --;
        }
        swap (r, low, high);
        while(low < high && r[low] <= pivotKey) {
            low ++;
        }
        swap (r, low, high);
    }

    return low;
}

void swap (int[] r, int i, int j) {
    r[0] = r[i];
    r[i] = r[j];
    r[j] = r[0];
}

public static void main (String[] a) {
    int[] r = {0, 108, 69, 75, 87, 89, 90, 99, 100, 1};
    QSort qSort = new QSort();
    qSort.quickSort(r);
    System.out.println("显示排序后的结果");
    for (int i = 1; i < r.length; i ++) {
        System.out.println(r[i] + ",");
    }
}

}