顺序表的查找

<pre name="code" class="cpp">#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 10
#define OK 0
#define OVERFLOAT -2
typedef int Status;
typedef int ElemType;
typedef struct
{
	ElemType *elem;
	int length;
}SqList;
Status InitList_Sq(SqList &L)//初始化线性表 
{   
    
    int a[MAXSIZE]={0,1,2,3,4,5,6,7,8,9};
    
	L.elem=a;
	L.length=MAXSIZE;
	
	
	
}
int LocateElem_Sq(SqList L,ElemType e)//顺序表的查找 
{   int i;
	for(i=0;i<L.length;i++)
	{
		if(*(L.elem++)==e)
		    return i+1;
	}
	return 0;
}
int main()
{   
    int c,b;
	SqList la;
	scanf("%d",&b);
	InitList_Sq(la);
	
	
	c=LocateElem_Sq(la,b);
	printf("%d is at %d\n",b,c);
}
	

  

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 10
#define OK 0
#define OVERFLOAT -2
typedef int Status;
typedef int ElemType;
typedef struct
{
	ElemType *elem;
	int length;
}SqList;
Status InitList_Sq(SqList &L)//初始化线性表 
{   int i;
	
	L.elem=new ElemType[MAXSIZE];//为顺序表分配一个大小为MAXSIZE的数组空间，
	                             //new不能对动态分配的数组存储区进行初始化 
	if(!L.elem)
        exit(OVERFLOAT);
	L.length=MAXSIZE;
	for(i=0;i<MAXSIZE;i++)
	{
		scanf("%d",&L.elem[i]);
	}
	
	return 0;
}
int LocateElem_Sq(SqList L,ElemType e)//顺序表的查找 
{   int i;
	for(i=0;i<L.length;i++)
	{
		if(L.elem[i]==e)
		    return i+1;
	}
	return 0;
}
int main()
{   float e;
    int c;
	SqList la;
	InitList_Sq(la);
	
	c=LocateElem_Sq(la,6);
	printf("%d\n",c);
	delete []la.elem; 
	
}