会python真的可以为所欲为0(回)
351天前
这里还有人吗1(回)
536天前这里还有人吗0(回)
536天前
每天面对着电脑屏幕，敲打键盘。我所面对的并不只是代码，而是一种生活方式。0(回)
761天前到处都是羊，不想上班0(回)
841天前
鸽子
0(回)
845天前#include <iostream> |
#include <algorithm> |
using namespace std; |
const int size = 1000; |
int partition ( int a[], int low, int high ) |
{ |
//选择第一个a[low]作为划分的临界值 |
while ( low < high ) |
{ |
while ( low < high && a[low] <= a[high] ) high--; |
swap ( a[low], a[high] ); |
while ( low < high && a[low] <= a[high] ) low++; |
swap ( a[low], a[high] ); |
} |
return low; |
} |
void Qsort ( int a[], int low, int high ) |
{ |
if ( low > high ) return; |
int p = partition ( a, low, high ); |
Qsort ( a, low, p-1 ); |
Qsort ( a, p+1, high ); |
} |
int main() |
{ |
int N, arr[size]; |
int i; |
while ( cin >> N ) |
{ |
for ( i = 0; i < N; ++i ) |
cin >> arr[i]; |
Qsort ( arr, 0, N-1 ); |
for ( i = 0; i < N-1; ++i ) |
cout << arr[i] << " "; |
cout << arr[i] << endl; |
} |
return 0; |
} |
