冒泡排序

#include <iostream>
using namespace std;
#define  MAXSIZE  20          					
typedef struct
{
	int key;
	char *otherinfo;
}ElemType;
typedef struct
{
    ElemType *r;	         						
    int  length;            						
}SqList;
int flag=1;										
void Create_Sq(SqList &L)
{
	int i,n;
	cout<<"请输入数据个数，不超过"<<MAXSIZE<<"个。"<<endl;
	cin>>n;											
	cout<<"请输入待排序的数据:\n";
	while(n>MAXSIZE)
	{
		cout<<"个数超过上限，不能超过"<<MAXSIZE<<"，请重新输入"<<endl;
		cin>>n;
	}
	for(i=1;i<=n;i++)
	{
		cin>>L.r[i].key;
		L.length++;
	}
}
void show(SqList L)
{
	int i;
	for(i=1;i<=L.length;i++)
		cout<<L.r[i].key<<" ";
	cout<<endl;
}

void BubbleSort(SqList &L)
{
	int i,j,flag=1;
	for(i=1;i<L.length;i++)
	{
		for(j=1;j<=L.length-i;j++)
		{
			if(L.r[j+1].key<L.r[j].key)
			{
				int t=L.r[j].key;
				L.r[j].key=L.r[j+1].key;
				L.r[j+1].key=t;
			}
		}
		cout<<"第 "<<flag++<<" 趟排序 ";
		show(L);
		cout<<endl;	
		
	}
}

void main()
{
	SqList L;
	L.r=new ElemType[MAXSIZE+1];
	L.length=0;
	Create_Sq(L);
	BubbleSort(L);
	cout<<"排序后的结果为："<<endl;
	show(L);
}