数据结构之第二章线性表~~继续

int locatlink(PNODE head,int e,int (*compare)(int ,int ))
    {//在head中查询第一个满足条件的元素的位置，若不存在，则返回-1
        i；
while（i<head.length&&！（*compare)(head.elem[i],e))
    ++i;
if(i<head.length)
    return i;
else 
    return -1;
}

void hebing(PNODE head1,PNODE head2,PNODE head3){
    int i=0,j=0,k=0;
    head3.listsize=head3.length=head1.length+head2.length;
    head3.elem=(PNODE)malloc(sizeof(NODE));
    if(head3.elem==NULL)
    exit(-1);
    while(i<head1.length&&j<head2.length)//合并
    {
        if(head1.elem[i]<=head2.elem[j])
        {
            head3.elem[k++]=head1.elem[i++];
            
         }
        else 
             head3.elem[k++]=head2.elem[j++]; 
    }
    while(i<head1.length)//插入head1的剩余元素
    {
        head3.elem[k++]=head1.elem[i++];
        
    }
    while(j<head2.length)
    {
        head3.elem[k++]==head2.elem[j++];
    }
 }