快速排序

#include <iostream>
#include <string>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <map>
using namespace std;

int arr[105];

void quick_sort(int i,int j){
    int left = i;
    int right = j;
    int base = arr[i];  //记录基准元素

    if(left>right)
        return;

    while(i!=j){
        //必须先从右往左进行试探
        while(arr[j]>=base&&j!=i)
            j--;
        while(arr[i]<=base&&i!=j)
            i++;
        if(i!=j){
            int temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
    }
    arr[left] = arr[i];
    arr[i] = base;
    quick_sort(i+1,right);
    quick_sort(left,i-1);
}

int main() {
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&arr[i]);
    quick_sort(1,n);
    for(int i=1;i<=n;i++)
        printf("%d ",arr[i]);
    return 0;
}