template<typename T>
int rSequentialSearch(T a[], int n, const T &x)
{
if (n < 1)return -1;
if (a[n - 1] == x) return n - 1;
return rSequentialSearch(a, n - 1, x);
}
转载于:https://my.oschina.net/u/1267048/blog/898526
线性查找的递归实现
template<typename T>
int rSequentialSearch(T a[], int n, const T &x)
{
if (n < 1)return -1;
if (a[n - 1] == x) return n - 1;
return rSequentialSearch(a, n - 1, x);
}
转载于:https://my.oschina.net/u/1267048/blog/898526
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
扫一扫
