bubblesort.cpp

c语言数据结构源代码（全）相当经典

//BubbleSort.cpp
//冒泡排序
# include <iostream.h>
# include <conio.h>
# include <stdio.h>

# define MAXSIZE 20
# define MAX_LENGTH 100
typedef int RedType;

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

void BubbleSort(SqList &L)
{   int i,j,temp;
    for(i=0;i<=L.length;++i)
       for(j=L.length-2;j>i;--j)
		   if(L.r[j+1]<L.r[j])
		   {	temp=L.r[j+1];		//交换L.r[j+1]和L.r[j]
				L.r[j+1]=L.r[j];
				L.r[j]=temp;
		   }
}//BubbleSort() end

void main()							//main() 函数
{  int i;
   SqList L;
   cout<<endl<<endl<<"BubbleSort.cpp";
   cout<<endl<<"=============="<<endl;
   cout<<endl<<"Please input the length of SqList (eg,5): ";
   cin>>L.length;
   for(i=1;i<=L.length;++i)
   {   cout<<"Please input the "<<i<<"th element of SqList (eg,58): ";
       cin>>L.r[i];
   }
   cout<<endl<<"The disordered : ";		//未排序的线性表
   for(i=1;i<=L.length;i++)
       cout<<L.r[i]<<"  ";
   BubbleSort(L);						//调用 BubbleSort()
   cout<<endl<<"The ordered    : ";
   for(i=1;i<=L.length;i++)				//排序后的线性表
		cout<<L.r[i]<<"  ";
   cout<<endl<<endl<<"...OK!...";
   getch();
} //main() end