c_cpp 快速排序

Posted 2021-05-14

#include <iostream>
using namespace std;

int partition(int a[], int low, int high){
    int pivot = a[high];
    int i = low-1;
    for(int j = low;j < high; j++){
        if (a[j] <= pivot)
            swap(a[++i], a[j]);
    }
    swap(a[i+1], a[high]);
    return i+1;
}

int quicksort(int a[], int low, int high){
    if (low < high){
        int pi = partition(a, low, high);

        quicksort(a, low, pi-1);
        quicksort(a, pi+1, high);
    }
}

int main(){
    int n;
    cout << "No.of elements \n";
    cin >> n;
    int a[n];
    cout << "Enter the elements \n";
    for (int i = 0;i<n;i++)
        cin >> a[i];

    quicksort(a,0,n-1);
    for (int i = 0;i<n;i++)
        cout << a[i] << "  ";
}