时间复杂程度，空间复杂程度，线性表的相关习题

时间复杂程度

执行当前算法所消耗的时间；

空间复杂程度

执行当前算法所消耗的内存空间；

答案：

10

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<string.h>
#include"Seqlist.h"
int Compare(Seqlist*a,Seqlist*b)
{
	assert(a != nullptr && b != nullptr);
	int tag = 0;
	int i = 0;
	while (i<a->cursize&&i<b->cursize)
	{
		tag = a->data[i] - b->data[i];
		i++;
		if (tag != 0) break;
	}
	if (tag == 0)
	{
		tag = a->cursize > b->cursize ? 1 : -1;
	}
	return tag;
}
int main()
{
	Seqlist a, b;
	int arr[] = {1,2,3,5,7,8,9,22,44,55};
	int an = sizeof(arr) /sizeof (arr[1]);
	int brr[] = {1,2,3,5,7,8};
	int bn = sizeof(brr) / sizeof(brr[1]);
	Init(&a);
	Init(&b);
	for (int i = 0; i < an; i++)
	{
		Insert_pos(&a, arr[i], i);
	}
	for (int i = 0; i < bn; i++)
	{
		Insert_pos(&b, brr[i], i);
	}
	Printf(&a);
	Printf(&b);
	printf("%d\n", Compare(&a, &b));
	return 0;
}

11，

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<string.h>
#include"Seqlist.h"
void Inverse(Seqlist*a)
{
	assert(a!=nullptr);
	int left = 0, right = a->cursize-1;
	while (left < right)
	{
		int tem = a->data[left];
		a->data[left] = a->data[left];
		a->data[left] = tem;
		left++;
		right--;
	}
}
int main()
{
	Seqlist a, b;
	int arr[] = {1,2,3,5,7,8,9,22,44,55};
	int an = sizeof(arr) /sizeof (arr[1]);
	Init(&a);
	Init(&b);
	for (int i = 0; i < an; i++)
	{
		Insert_pos(&a, arr[i], i);
	}
	Printf(&a);
	Inverse(&a);
	Printf(&a);
	return 0;
}

12

void Merge(Seqlist*a,Seqlist*b,Seqlist*c)
{
	assert(a!=nullptr&&b!=nullptr&&c!=nullptr);
	int pa = 0, pb = 0;

	while (pa < a->cursize && pb < b->cursize)
	{
		if (a->data[pa] < b->data[pb])
		{
		 
		a++;
		}
	
	
	
	
	
	}

13，
实现的思想：
i,j,k分别表示a,b,c的下标初值为0；
a先和b比较值小的下标加一；
如果a,b的值相等则都不加1，
在这个前提下在用a和c比较，
值小的下标加一；如果相等
则说明此时三个顺序表里都有该数字则使用下标删除函数
i,j,k 同时加1 ；

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<string.h>
#include"Seqlist.h"
void Dele(Seqlist*a,Seqlist*b,Seqlist*c)
{
	assert(a!=nullptr&&b!=nullptr&&c!=nullptr);
	int i = 0, j = 0, k = 0;
	while (i < a->cursize && j < b->cursize && k < c->cursize)
	{
		if (a->data[i] < b->data[j])
		{
			i++;
		}
		else if (a->data[i] > b->data[j])
		{
			j++;
		}
		else
		{
		   if (a->data[i] < c->data[k])
			{
				i++;
			}
		   else if (a->data[i] > c->data[k])
		   {
			 k++;
		   }
		  else
		   {
			Del_pos(a,i);
			i++;
			j++;
			k++;
		   }
		}
	}
}
int main()
{
	Seqlist a, b,c;
	int arr[] = {1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
	int an = sizeof(arr) /sizeof (arr[1]);
	int brr[] = {0,1,3,4,9,12,13,14,19};
	int bn = sizeof(brr) / sizeof(brr[1]);
	int crr[] = {2,4,5,8,10,11,12,14,17,19};
	int cn = sizeof(crr) / sizeof(crr[0]);
	Init(&a);
	Init(&b);
	Init(&c);
	for (int i = 0; i < an; i++)
	{
		Insert_pos(&a, arr[i], i);
	}
	for (int i = 0; i < bn; i++)
	{
		Insert_pos(&b, brr[i], i);
	}
	for (int i = 0; i < cn; i++)
	{
		Insert_pos(&c, crr[i], i);
	}
	Printf(&a);
	Printf(&b);
	Printf(&c);
	Dele(&a,&b,&c);
	Printf(&a);
	return 0;
}

16，

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<string.h>
#include"Seqlist.h"
void unio(Seqlist* a, Seqlist* b, Seqlist* c)
{
	assert(a!=nullptr&&b!=nullptr&&c!=nullptr);
	int i = 0, j = 0, k = 0;
	while (i < a->cursize && j <b->cursize)
	{
		if (a->data[i] < b->data[j])
		{
			if (Isfull(c) && Inc_capacity(c)) ;
		c->data[k] = a->data[i];
		i++;
		k++;
		c->cursize += 1;
	  }
	  else if (a->data[i] > b->data[j])
	  {
			if (Isfull(c) && Inc_capacity(c));
		 c->data[k] = b->data[j];
		 k++;
		 j++;
		 c->cursize+=1;
	  }
	  else
	  {
			if (Isfull(c) && Inc_capacity(c));
		 c->data[k] = a->data[i];
		 i++;
		 j++;
		 k++;
		 c->cursize += 1;
	  }
	}
	while(i== a->cursize)
	{
		if (Isfull(c) && Inc_capacity(c));
		if (j == b->cursize) break;
		c->data[k] = b->data[j];
		k++;
		j++;
		c->cursize += 1;
	}
	while (j == b->cursize)
	{
		if (Isfull(c) && Inc_capacity(c));
		if (i == a->cursize) break;
		c->data[k] = a->data[i];
		k++;
		i++;
		c->cursize += 1;
	}
}

int main()
{
	Seqlist a, b,c;
	int arr[] = {1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
	int an = sizeof(arr) /sizeof (arr[1]);
	int brr[] = {0,1,3,4,9,12,13,14,19};
	int bn = sizeof(brr) / sizeof(brr[1]);
	int crr[] = {2,4,5,8,10,11,12,14,17,19};
	int cn = sizeof(crr) / sizeof(crr[0]);
	Init(&a);
	Init(&b);
	Init(&c);
	for (int i = 0; i < an; i++)
	{
		Insert_pos(&a, arr[i], i);
	}
	for (int i = 0; i < bn; i++)
	{
		Insert_pos(&b, brr[i], i);
	}
	Printf(&a);
	Printf(&b);
	unio(&a, &b,& c);
	Printf(&c);
	return 0;
}