stooge排序

#include<iostream>
using namespace std;
void stoogeSort(int a[],int s,int t)
{
    int temp;
	int k;
    if (a[s]>a[t])
	{
		temp = a[s];
		a[s] = a[t];
		a[t] = temp;
	}       
    if (s+1>=t)
	{
        return;
	}
    k=(t-s+1)/3;
    stoogeSort(a,s,t-k);
    stoogeSort(a,s+k,t);
    stoogeSort(a,s,t-k);
}
void main()
{
    cout <<"您将为几个整数进行排序？"<<endl;
    int n;
    cin >> n;
    int * A = new int[n];
    cout<<"输入数组"<<endl;
    for(int i = 0 ;i < n ;i++)
    {
        cin >> A[i];
    }
    stoogeSort(A,0,n-1);
    int i;
    for(i = 0;i<n;i++)
    {
       cout << A[i]<<"  ";
    }
    delete []A;
	system("pause");
}