#include <stdio.h>
#define MAX 1000
int main(){
void qsort(int v[], int left, int right);
int a[MAX] = {0};
int c;
int i = 0;
while((c=getchar())!='\n'){
a[i++] = c - '0' ;
}
qsort(a,0,i-1);
return 0;
}
void qsort(int v[], int left, int right){
void swap(int v[],int left, int right);
if (right<=left)
return;
// else if (right == left + 1)
// swap(v,left,right);
// return;
int mid = (left + right)/2;
for(int i = left; i<= right; i++){
本来是从小到大排序的,实现的确实从大到小,不明白为什么。。。#include #define MAX 1000int main(){ void qsort(int v[], int left, int right); int a[MAX] = {0}; int c; int i = 0; while((c=getchar())!='\n'){ a[i++] = c - '