05070202212.cpp

数据结构（清华版）

#include<iostream.h>
typedef char Elemtype;

//构建结构体
struct SList
{
	Elemtype *elem;
	int length,listsize;
};

//创建线性表
bool ListCreate(SList  &L,int n,Elemtype a[])
{
	int i;
	L.elem=new Elemtype[n+100];
	if(!L.elem) return false;
	L.length=n;
	L.listsize=n+100;
	for(i=0;i<n;i++) L.elem[i]=a[i];
	return true;

}

//构建比较函数
void compare (SList A,SList B)
{

	bool T;
	int i(0);
//法一比较大小
	if(T)
	{
		do             //设置循环，逐个比较
		{
			if(A.elem[i]>B.elem[i]) 
			{                              
				cout<<"A>B"<<endl;
				break;
			}
			else if(A.elem[i]<B.elem[i]) 
			{
				cout<<"A<B1"<<endl;
				break;
			}
			
			i++;
		}while(i<B.length&&i<A.length);
		T=false;

		if (B.length==i<A.length)
			cout<<"A=B"<<endl;
		if(A.length>B.length) 
			cout<<"A>B"<<endl;
		if(A.length<B.length) 
			cout<<"A<B2"<<endl;
	
	}


 //法二比较大小
	/*if(A.length>B.length)
	{
		for(int i=0;i<B.length;i++)//设置循环，逐个比较
		{
			if(A.elem[i]>B.elem[i]) 
			{cout<<"A>B"<<endl;break;}
			else if(A.elem[i]<B.elem[i]) 
			{cout<<"A<B"<<endl;break;}
		}			
		cout<<"A>B"<<endl;
	}
	else if(A.length==B.length) 
	{
		for(int i=0;i<B.length;i++)//设置循环，逐个比较
		{
			if(A.elem[i]>B.elem[i]) 
			{cout<<"A>B"<<endl;break;}
			 if(A.elem[i]<B.elem[i]) 
			{cout<<"A<B"<<endl;break;}
		}			
	}
	else 
	{
		for(int i=0;i<A.length;i++)//设置循环，逐个比较
		{
			if(A.elem[i]>B.elem[i]) 
			{cout<<"A>B"<<endl;break;}
			else if(A.elem[i]<B.elem[i]) 
			{cout<<"A<B"<<endl;break;}
		}
		cout<<"A<B"<<endl;
	}*/
}


//主函数
void main()
{
	SList A,B;//声明线性表
	char x,y,d;

	char a[]={' x','x'};
	char b[]={ 'x','a','d'};

    ListCreate( A,2, a);//调用构建线性表函数
	ListCreate( B, 3, b);
	compare(A,B);//调用比较函数

}