改进的冒泡排序

#define MAXSIZE 100
typedef int KeyType;
typedef int InfoType;
typedef struct{
	KeyType key;
	InfoType otherinfo;
}RedType;
typedef struct{
	RedType r[MAXSIZE+1];
	int length;
}SqList;
void GBubbletSort(SqList &L);
void ShowList(SqList &L);

#include"head.h"
#include<iostream>
using namespace std;
void GBubbletSort(SqList &L)
{
	RedType chan;
	int lastswap=L.length-1;
	int flag=L.length-1;
	for(int i=0;i<L.length;i++)
	{
		lastswap=flag;
		for(int j=0;j<lastswap;j++)
		{
			if(L.r[j].key>L.r[j+1].key)
			{
				chan=L.r[j];
				L.r[j]=L.r[j+1];
				L.r[j+1]=chan;
				flag=j;
			}
		}
		if(flag==lastswap)
				break;
	}
}
void ShowList(SqList &L)
{
	if(L.r==NULL)
	{
		cout<<"the array is not exist!"<<endl;
		exit(0);
	}
	for(int i=0;i<L.length;i++)
		cout<<L.r[i].key<<"  ";
	cout<<endl;
}

#include"head.h"
#include<iostream>
using namespace std;
void main()
{
	cout<<"请输入数组长度length：";
	int length;
	cin>>length;
	cout<<"请输入"<<length<<"个数："<<endl;
	SqList arr;
	arr.length=0;
	for(int i=0;i<length;i++)
	{
		cin>>arr.r[i].key;
		arr.length++;
	}
	GBubbletSort(arr);
	cout<<"冒泡排序后的数组："<<endl;
	ShowList(arr);
}