#include <iostream>
#include <stdlib.h>
using namespace std;
int partition(int a[], int begin, int end);
void quickSort ( int a[], int l, int r);
void print(int a[], int length);
int main()
{
int a [10];
int i;
for(i = 0; i < 10; i++) {
a[i] = rand() % 100;
}
print(a, 10);
cout << "Hello world!" << endl;
quickSort(a,0,9);
print(a, 10);
return 0;
}
int partition(int a[], int begin, int end) {
int l = begin;
int r = end;
int temp = a[l];
while(l < r){
while((l < r) && a[r] >= temp) {
r--;
}
if(l < r) {
a[l++] = a[r];
}
while((l < r) && a[l] <= temp){
l++;
}
if(l < r){
a[r--] = a[l];
}
a[l] = temp;
}
return l;
}
void quickSort ( int a[], int l, int r) {
int mid;
if(l < r){
mid = partition(a, l, r) ;
// cout << mid << endl;
quickSort(a, l, mid);
quickSort(a, mid+1,r);
}
}
void print(int a[], int length) {
int i = 0;
for(; i < length-1; i++ ) {
cout << a[i] << endl;
}
}
居然让我高兴这么久,可见我的水平有多凹。