824（快速排序）.cpp

按Pearson Prentice Hall

#include<iostream.h>
int array[100];
void quicksort(int array[],int begin,int end){
	int a=array[begin];
	int p1=begin;
	int p2=end;
	while(p1<p2){
		while(array[p2]>=a && p1<p2){
			p2--;
		}
		if (array[p2]<a){
			array[p1]=array[p2];
			array[p2]=a;
		}
		while(array[p1]<=a && p1<p2){
			p1++;
		}
		if (array[p1]>a){
			array[p2]=array[p1];
			array[p1]=a; 
		}
	}
	if (p2+1<end)
		quicksort(array,p2+1,end);
	if (begin<p1-1)
		quicksort(array,begin,p1-1);
}

void main(){
	int n;
	cout << "Please input the number of integers:" << endl;
	cin >> n;
	for (int i=0;i<n;i++){
		cout << "Please input an integer:" << endl;
		cin >> array[i];
	}
	quicksort(array,0,n-1);
	for (i=0;i<n;i++)
		cout << array[i] << "\t";
}