#include<bits/stdc++.h>
using namespace std
;
int part(int a
[],int l
,int r
)
{
int x
=a
[l
];
int i
=l
;
int j
=r
+1;
while(1)
{
while(i
<r
&&a
[++i
]<=x
);
while(j
>l
&&a
[--j
]>=x
);
if(i
>=j
)
break;
swap(a
[i
],a
[j
]);
}
swap(a
[j
],a
[l
]);
return j
;
}
void Qsort(int a
[],int l
,int r
)
{
if(l
<r
)
{
int p
=part(a
,l
,r
);
Qsort(a
,l
,p
-1);
Qsort(a
,p
+1,r
);
}
}
int main()
{
int a
[100];
for(int i
=1;i
<=6;i
++)
cin
>> a
[i
];
Qsort(a
,1,6);
for(int i
=1;i
<=6;i
++)
cout
<< a
[i
] <<" ";
return 0;
}
转载请注明原文地址: https://www.6miu.com/read-5028095.html
