顺序表基本知识1

目录

按值查找

合并有序表

完整代码

---

//按值查找
int LocateSeqList(SeqList *L,ElemType x)
{
	int i;
	for(i = 0;i <L->length;i ++)
	{
		if(L->data[i]==x) return i;
	}
	return -1;
} 

合并有序表

//合并有序表
SeqList *MergeSeqList(SeqList *a,SeqList *b)
{
	SeqList *c;
	int i = 0,j = 0,k = 0;
	c=initSeqList();
	while(i<a->length && j<b->length)
	{
		if(a->data[i] <= b->data[j])
		{
			c->data[k++]=a->data[i++];
			c->length++;
		}
		else
		{
			c->data[k++]=b->data[j++];
			c->length++;
		}
	}
	while(i<a->length)
	{
		c->data[k++]=a->data[i++];
		c->length++;
	}
	while(i<b->length)
	{
		c->data[k++]=b->data[j++];
		c->length++;
	}
	return c;
} 
 

完整代码