mp.cpp

数据结构基础代码

//冒泡排序,并用两种方式结束排序工作
#include <iostream.h>
#include "mp.h"
sqlist l;
void main()
{
	int circle=1;
	int choice;
	cout<<"选择束方式:"<<endl;
	cout<<"========================================================="<<endl;
	cout<<"1. 无判断的条件"<<endl;
	cout<<"2. 有判断的条件"<<endl;
	cout<<"3.  退出"<<endl;
	cout<<"在选择排序前,先创建线形表:"<<endl;
	InitList_Sq(l);
	create_sq(l);
	while(circle)
	{
		cout<<"请选择:"<<endl;
		cin>>choice;
		switch(choice)
		{
		case 1:
			int i,num;
			cout<<"无判断冒泡排序后的线形表是:"<<endl;
			num=bubblesort(l,l.length);
			for(i=1;i<=l.length;++i)
			{
			cout<<l.elem[i]<<'\t';
			}
			cout<<endl;
			cout<<"交换的次数是:"<<num<<endl;
			break;
		case 2:
			int number;
			cout<<"有判断排序后的线形表是:"<<endl;
			number=bubblesortch(l,l.length);
			for(i=1;i<=l.length;++i)
			{
			cout<<l.elem[i]<<'\t';
			}
			cout<<endl;
			cout<<"交换的次数是:"<<num<<endl;
			break;
		case 3:
			circle=0;
			break;
		}
		cout<<"========================================================\n";
	}
}