选择排序代码分析,acwing

快速排序问题
#include<stdio.h>
#define ll long long
void quick_sort(ll num[],ll left,ll right){
    if(left>=right) return;
    ll begin=left;
    ll end=right;
    ll index=num[left];
    while(begin<end){
        while(num[begin]<index&&begin<end) begin++;
        while(num[end]>index&&begin<end) end--;
        ll temp=num[begin];
        num[begin]=num[end];
        num[end]=temp;
        begin++;end--;
    }
    quick_sort(num,left,end);
    quick_sort(num,begin,right);
}
int main()
{
    ll n;
    scanf("%lld",&n);
    ll num[100010];
    for(int i=0;i<n;i++){
        scanf("%lld",&num[i]);
    }
    quick_sort(num,0,n-1);
    for(int i=0;i<n;i++){
        printf("%lld ",num[i]);
    }
    return 0;
}

img

我真的要绝望了,大 佬们救救我吧

好像没问题啊

你到底是选择排序还是快速排序???