8.3作业

	//调用查找函数
	list_search_value(S,100);

	//调用排序函数
	list_sort(S,0);

	//调用求最值函数
	list_mvalue(S,0);

	//调用反转函数
	list_reverse(S);
	return 0;

//按值进行查找元素
int list_search_value(seqListPtr S, datatype e)
{
	//判断逻辑
	if (NULL == S || list_empty(S))
	{
		printf("查找失败\n");
		return 0;
	}

	//开始查找
	//设置一个flag
	int flag = 0;
	for (int i = 0; i < S->len; i++)
	{
		if(S->data[i] == e)
		{
			flag = 1;   //找到了
			printf("第%d个值是%d\n",i+1, e);
		}
	}
	if(flag == 0)
	{
		printf("没有找到");
		return -1;
	}
}

//将顺序表排序(选择排序)
void list_sort(seqListPtr S, int flag)  //1升序,0降序
{
	//判断逻辑
	if (NULL == S || list_empty(S))
	{
		printf("查找失败\n");
		return;
	}
	
	//开始排序
	int index = 0;
	datatype temp;
	if (flag == 1)   //升序
	{
		for (int i = 1; i < S->len; i++)
		{
			index = i-1;
			for (int j = i-1; j < S->len; j++)
			{
				if (S->data[j] < S->data[index])
				{
					index = j;
				}
			}
			if(index!=i-1)
			{
				temp = S->data[index];
				S->data[index] = S->data[i-1];
				S->data[i-1] = temp;
			}
		}
	}
	else if(flag == 0)  //降序
	{	
		for (int i = 1; i < S->len; i++)
		{
			index = i-1;
			for (int j = i-1; j < S->len; j++)
			{
				if (S->data[j] > S->data[index])
				{
					index = j;
				}
			}
			if(index!=i-1)
			{
				temp = S->data[index];
				S->data[index] = S->data[i-1];
				S->data[i-1] = temp;
			}
		}
	}
}

//求最值操作
datatype list_mvalue(seqListPtr S,int flag) //0为最小值,1为最大值
{
	datatype temp;
	datatype index = S->data[0];
	if (flag == 1)         //求最大值
	{
		for (int i = 0; i < S->len; i++)
		{
			if (S->data[i]>index)
			{
				index = S->data[i];
			}
		}
		printf("最大值为%d\n",index);
	}
	else                  //求最小值
	{
		for (int i = 0; i < S->len; i++)
		{
			if (S->data[i]<index)
			{
				index = S->data[i];
			}
		}
		printf("最小值为%d\n",index);
	}
}

//顺序表反转
void list_reverse(seqListPtr S)
{
	datatype temp;
	for (int i = 0; i < (S->len)/2; i++)
	{
		temp = S->data[i];
		S->data[i] = S->data[S->len-1-i];
		S->data[S->len-1-i] = temp;
	}
	printf("反转之后的顺序为:");
	for (int i = 0; i < S->len; i++)
	{
		printf("%d ", S->data[i]);