顺序排序
template <typename T>
T SequentialSearch(T *list, const int num, const T x)
{
int i = 0;
for (; i < num; i++)
{
if (list[i] == x)
{
return i;
}
}
if (i == num)
{
return -1;
}
}