7.19-数据结构-作业

//按值修改
int listUpdateValue(seqList *S,datatype old_e,datatype new_e)
{
	//判断逻辑
	if(listEmpty(S))
	{
		return -1;
	}
	//修改逻辑
	for(int i=0;ilen;i++)
	{
		if(old_e==S->data[i])
		{
			S->data[i] = new_e;
		}
	}
}

//按位置查找返回查找
datatype listSearchPos(seqList *S,int pos)
{
	//判断逻辑
	if(pos>S->len-1 || pos<0)
	{
		return -1;
	}
	return S->data[pos];

}

//选择排序
void listselectionSort(seqList *S)
{
	int index;
	datatype temp;
	
	for(int i=0;ilen;i++)
	{
		index = i;
		for(int j=i;jlen;j++)
		{
			if(S->data[j]>S->data[i])
			{
				index=j;
			}
		}
		if(index!=i)
		{
			temp = S->data[i];
			S->data[i] = S->data[index];
			S->data[index] = temp;
		}
	}
}