快速排序

#include <iostream>

using namespace std;

int partition(int arr[], int L, int R){
    int pivot = arr[R];
    int j = L;
    for(int i = L; i < R; i++){
        if(arr[i] < pivot){
            int temp = arr [j];
            arr[j] = arr[i];
            arr[i] = temp;
            j++;
        }
    }
    int temp = arr[j];
    arr[j] = arr[R];
    arr[R] = temp;
    return j;
}

void quickSort(int arr[], int L, int R){
    if(L < R){
        int M = partition(arr, L, R);
        quickSort(arr, L, M-1);
        quickSort(arr, M+1, R);
    }
}

int main(){
    int arr[] = {3,8,1,2,5,4};
    quickSort(arr, 0, 5);
    for(int i = 0; i < 6; i++){
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}