//设A=(a1,a2...,an)和B=(b1,b2...,bn)均为顺序表，比较A与B大小
#include <stdio.h>
#include <stdlib.h>
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OVERFLOW 0
#define LEN sizeof(Sqlist)
typedef struct {
    char * elem;
    int length;
    int listsize;
}Sqlist;
void InitList_Sq(Sqlist &L) {
    /*构造一个空的线性表*/
    L.elem=(char *)malloc(LIST_INIT_SIZE * sizeof(char));
    if (!L.elem) exit(OVERFLOW);
    L.length = 0;
    L.listsize = LIST_INIT_SIZE;
    return;
} /*InitList_Sq*/



void Comparison_Sq(Sqlist A, Sqlist B) {
    int i = 0;
    while( i < A.length  && i < B.length )
    {
    if( A.elem[i] < B.elem[i] )
       {
        printf("A < B\n");
      
       }
    else if( A.elem[i] > B.elem[i] )
    printf("A > B\n");
    
    else
       i ++;
    }
    if(A.length < B.length )
    {
        printf("A < B\n");
     
    }
    else if ( A.length > B.length )
    {
        printf("A > B");
        
    }
    else
    {
        printf("A == B");
      
    }
}

void main()
{
    Sqlist A,B;

    int i=0,j=0;
    char flag;

    InitList_Sq(A); //构造空表A
    InitList_Sq(B); //构造空表B
    printf("请输入A的字母序列:\n");
    while(scanf("%c",&flag),A.listsize>=i) {
        if (flag == '\n') break;
        else {
                A.elem[i]=flag;  
                flag = NULL;
                A.length++;
                i++;
             }
        }
    printf("请输入B的字母序列:\n");
    while(scanf("%c",&flag),B.listsize>=j) {
        if (flag == '\n') break;
        else {
            B.elem[j]=flag;
            flag = NULL;
            B.length++;
            j++;} }
    /*比较:*/
    Comparison_Sq(A,B);
  
}

我改了下，现在有结果了
你看看，看是你要的结果吗
#include <stdio.h>
#include <stdlib.h>
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OVERFLOW 0
#define LEN sizeof(Sqlist)
typedef struct {
    char * elem;
    int length;
    int listsize;
}Sqlist;
void InitList_Sq(Sqlist &L) {
    /*构造一个空的线性表*/
    L.elem=(char *)malloc(LIST_INIT_SIZE * sizeof(char));
    if (!L.elem) exit(OVERFLOW);
    L.length = 0;
    L.listsize = LIST_INIT_SIZE;
    return;
} /*InitList_Sq*/



void Comparison_Sq(Sqlist A, Sqlist B) {
    int i = 0;
    /*
    */
   
    if(A.length < B.length )
    {
        printf("A < B\n");
        
    }
    else if ( A.length > B.length )
    {
        printf("A > B");
        
    }
    else
    {    
        while( i < A.length  && i < B.length )
        {
            if( A.elem[i] < B.elem[i] )
            {
                 printf("A < B\n");
                 break;
            }
            else if( A.elem[i] > B.elem[i] )
            {
                printf("A > B\n");
                break;
            }
        
            else
               i ++;
        }
    if(i-1 > A.length  && i-1 >B.length)
        printf("A == B");
        
    }
}

void main()
{
    Sqlist A,B;
    
    int i=0,j=0;
    char flag;
    
    InitList_Sq(A); //构造空表A
    InitList_Sq(B); //构造空表B
    printf("请输入A的字母序列:\n");
    while(scanf("%c",&flag),A.listsize>=i) {
        if (flag == '\n') break;
        else {
            A.elem[i]=flag;  
            flag = NULL;
            A.length++;
            i++;
        }
    }
    printf("请输入B的字母序列:\n");
    while(scanf("%c",&flag),B.listsize>=j) {
        if (flag == '\n') break;
        else {
            B.elem[j]=flag;
            flag = NULL;
            B.length++;
            j++;} }
    /*比较:*/
    Comparison_Sq(A,B);
    
}

非常感谢！受到你的启发！

我得到了我要的结果！Thanks!

我在TC2.0下运行修改后的程序.出现错误
在void InitList_Sq(Sqlist &L)这行的L上.
不知道是什么原因/

TC显然是没有引用的……

问题是：在递增有序的顺序表va中插入元素x，保持顺序表的有序性


#include<stdio.h>
#include<stdlib.h>
#define OVERFLOW 0
#define OK 1
#define LIST_INIT_SIZE
typedef struct{
         int * elem;
         int length;
         int listsize;
} SqList;

InitSqlist(SqList &va)
{
    va.elem=(int*)malloc(sizeof(int));
    if(!va.elem) exit(OVERFLOW);
    va.length=0;
    va.listsize=LIST_INIT_SIZE;
    return OK;
} /*构造一个空表*/

InsertOrderList(SqList va)
{
    int i,x;
    printf("请输入要插入的元素x:");
    scanf("%d",&x);
    if(va.length==va.listsize)
      return (OVERFLOW);
    for(i=va.length-1;va.elem[i]>x&&i>=0;i--) //查找x的插入位置
           va.elem[i+1]=va.elem[i];    //元素后移
           va.elem[i+1]=x;   //插入x
           va.length++; //表长加1
          return OK;
} //InsertOrderList

void main()
{
   SqList va;
   int m,i;
   printf("请输入顺序表va中元素的个数m:");
   scanf("%d",&m);
   printf("请输入顺序表va中递增有序的m个整型数据元素:\n");
   for(i=0;i<m;i++)
     scanf("%d",&va.elem[i]);
int InsertOrderList();
for(i=0;i<va.length;i++)
   printf("%d",va.elem[i]);
}