数据结构day3

int list_search_value(seqListPtr S, datatype e)
{
	int flag =0;
	for(int i = 0; i < S->len-1; i++)
	{
		if(e == S->data[i])
		{
			flag =1;
		}
	}
	if(1 == flag)
	{
			printf("顺序表查中有找有此元素\n");
		
	}
	else if(0 == flag)
	{
		printf("顺序表中无此元素\n");
	}
}
void list_sort(seqListPtr S, int flag)
{
	int i = 0;
	int j = 0;
	int  index = 0;
	datatype temp;
	printf("将输入的数据进行排序\n");
switch (flag)
{
case 1:
		 for(int i = 1; i < S->len; i++)
		 {
			  index = i - 1;
	 		for( j = i-1; j < S -> len; j++ )
			{
				if(S -> data[index] > S->data[j])
				{
					index = j;
				}
			}
			if(index != i-1 )
			{
				temp = S->data[index];
				S-> data[index] = S->data[i-1];
				S->data[i-1] = temp;
			}
		 }
case 0:
		 for(int i = 1; i < S->len; i++)
		 {
			  index = i - 1;
	 		for( j = i-1; j < S -> len; j++ )
			{
				if(S -> data[index] < S->data[j])
				{
					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)
{
	int i = 0;
	int Max = S->data[0];
	int MIN = S ->data[0];
	switch (flag)
	{
	case 1:
		for(i = 0; i < S->len; i++)
		{
			if(Max < S->data[i])
			{
				Max = S ->data[i];	
			}
		}
		printf("最大值为：%d\n", Max);
	case 0:
		for(i = 0; i < S->len; i++)
		{
			if(MIN > S -> data[i])
			{
				MIN = S -> data[i];
			}
		}
		printf("最小值为：%d\n", MIN);
	}
}