设计求解下列问题的类C语言算法，并分析其最坏情况时间复杂性及其量级.

我只会第一个，因为我以前编过，我就只能给第一个了，不好意思。 #include
#include/*动态存储分配库函数*/
#define LIST_INIT_SIZE 100typedef int ElemType;typedef struct
{
int *elem;
int length;
int listsize;
}SqList;void InitList_Sq(SqList *L)
{
L->elem=(int *)malloc(LIST_INIT_SIZE*sizeof(int));
if(!L->elem)
printf("Memory allocate failure!!");
L->length=0;
L->listsize=LIST_INIT_SIZE;
}void InputElem_Sq(SqList *L)
{
int x;
int i;
i=1;
scanf("%d",&x);
while(x!=0)
{
L->elem[i]=x;
i++;
scanf("%d",&x);
}
L->length=i;
}void PrintList_Sq(SqList *L)
{
int i;
i=1;
while(ilength)
{
printf("%5d",L->elem[i]);
i++;
}
printf("\n");
}Search_Seq(SqList *L,ElemType key)
{
int i;
L->elem[0]=key;
for(i=L->length;L->elem[i]!=key;--i);
printf("The locate is :");
printf("%d",i);
return i;
}void main( )
{ SqList L;
int data;
int i;
InitList_Sq(&L); printf("Input the numbers of L:\n");
InputElem_Sq(&L);

printf("The list is:\n");
PrintList_Sq(&L); printf("input the value you want search:\n");
scanf("%d",&data); Search_Seq(&L,data);

}