算法设计与分析实验报告格式

int sort(int *a,int low,int high) { mid=a[low]; while (low=mid) high--; temp=a[low];a[low]=a[high];a[high]=temp; while (low int sPath(int*,int,int); int aSize=0; int main(){

cin>>aSize; int *x=new int[aSize]; int *y=new int[aSize]; for(int i=0;i>x[i]; cin>>y[i]; } int p=0; p=sPath(y,0,aSize-1); cout<