实现快速排序算法

#include"iostream"
using namespace std;
class sort{
private:
	int data[20];
	int length;
public:
	sort()
	{
		cout << "请输入元素个数" << endl ;
		cin >> length;
		cout << "请输入元素" << endl ;
		for(int i=0;i<length;i++)
			cin >> data[i] ;
	}
	void quicksort(int s,int t)
	{
		int i=s,j=t;
		int key;
		if(s<t)
		{
			key=data[s];
			while(i!=j)
			{
				while(j>i&&data[j]>=key)
					j--;
				data[i]=data[j];
				while(i<j&&data[i]<=key)
					i++;
				data[j]=data[i];
			}
			data[i]=key;
			for(int m=0;m<length;m++)
				cout << data[m] << "  " ;
			cout << endl ;
			quicksort(s,i-1);
			quicksort(i+1,t);
		}
	}	
};

void main()
{
	sort s;
	int i,j;
	cout << "请输入要排序的开始序号" << endl ;
	cin >> i;
	cout << "请输入要排序的结束序号" << endl ;
	cin >> j;
	s.quicksort(i-1,j-1);
}