#include <iostream.h>
//輸出函數(shù)
int Output(int b[],int length)
{
for (int i=0;i<length;i++)
{
cout<<b[i]<<" ";
}
cout<<endl;
return 1;
}
//冒泡算法
void BubbleSort(int arr[],int nLen)
{
for (int i=0;i<nLen;i++)
{
for (int j=0;j<nLen-i-1;j++)
{
if (arr[j]>arr[j+1])
{
int y=arr[j];
arr[j]=arr[j+1];
arr[j+1]=y;
}
}
}
}
void main()
{
//int a[]={4,1,3,2,5};
//動(dòng)態(tài)輸入待排序數(shù)組
int nLength;
cout<<"Enter the numble of nData: nLength=";
cin>>nLength;
cout<<endl<<"Enter nData(nLength values):";
int* nData=new int[nLength];
for (int i=0;i<nLength;i++)
{
cin>>nData[i];
}
cout<<endl<<"former:"<<endl;
Output(nData,nLength);
cout<<endl<<"later:"<<endl;
BubbleSort(nData,nLength);
Output(nData,nLength);
}