/**
* 顺序查找 改进
*
*/
int Seq_Search_Improved(int[] a, int n, int key)
{
int i;
a[0] = key; //哨兵
i = n;
while (a[i] != key)
{
i--;
}
return i; // 返回0 则说明查找失败
}
/**
* 顺序查找 改进
*
*/
int Seq_Search_Improved(int[] a, int n, int key)
{
int i;
a[0] = key; //哨兵
i = n;
while (a[i] != key)
{
i--;
}
return i; // 返回0 则说明查找失败
}