编写一个快速排序的C++语言 要运行成功的 最好把运行成功的 DOS运行界面截图给我

把DOS运行成功的界面图截给我 然后解释一下这个程序具体的含义

要写试验报告的 谢谢

#include<iostream>
using namespace std;

#define MAXSIZE 50
#define EQ(a,b) ((a)==(b))
#define LT(a,b) ((a)<(b))
#define LQ(a,b) ((a)<=(b))
#define MAXSIZE 50
#define N 50
typedef int KeyType;
typedef int InfoType;

typedef struct
{
KeyType key;
InfoType info;
}RedType;

typedef struct
{
RedType r[MAXSIZE+1];
int length;
}SqList;

void Print1(SqList L)
{
int i;
for(i=1;i<=L.length;i++)
cout<<"("<<L.r[i].key<<","<<L.r[i].info<<")"<<" ";
cout<<endl;
}

int Partition(SqList &L,int low,int high)
{
RedType t;
KeyType key;
key=L.r[low].key;
while(low<high)
{
while(low<high && L.r[high].key>=key)
--high;
t=L.r[low];
L.r[low]=L.r[high];
L.r[high]=t;
while(low<high && L.r[low].key<=key)
++low;
t=L.r[low];
L.r[low]=L.r[high];
L.r[high]=t;
}
return low;
}

void QSort(SqList &L,int low,int high)
{
int loc;
if(low<high)
{
loc=Partition(L,low,high);
QSort(L,low,loc-1);
QSort(L,loc+1,high);
}
}

void QuickSort(SqList &L)
{
QSort(L,1,L.length);
}

void main()
{
int i,n;
RedType d[MAXSIZE];
SqList L;
cout<<"请输入数据的长度：";
cin>>n;
for(i=0;i<n;i++)
{
cout<<"请输入第"<<i+1<<"元素：";
cin>>d[i].key;
d[i].info=i+1;
L.r[i+1]=d[i];
}
L.length=n;
cout<<"快速排序前："<<endl;
Print1(L);
QuickSort(L);
cout<<"快速排序后："<<endl;
Print1(L);
}

#include <stdio.h> void fastsort(int a[],int f,int t) { int i,j,k,p; if(t-f>=1) { k=a[f]; i=f; j=t; p=-1; while(j>i) { if(p==1) { while(j>i&&a[i]<=k) i++; a[j]=a[i]; p=-1; } else { while(j>i&&a[j]>=k) j--; a[i]=a[j]; p=1; } } a[i]=k; fastsort(a,f, i-1); fastsort(a,i+1,t); } } void main() { int a[100]; int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); fastsort(a,0,n-1); for(int z=0;z<n;z++) printf("%d ",a[z]);

}