2019某大学复试编程题2

递归求数组最小值的下标的模板

#include<iostream>
using namespace std;
template<class T>
int search(T x[], int n)
{
	if (n == 0)
		return 0;
	int temp = search(x, n - 1);
	if (x[temp] > x[n])
		return n;
	else return temp;

}
int main()
{
	int a[] = {1,3,2,5,6,0,8,4};
	double b[] = { 1.1,1.3,2.3,206,0.5,9.8 };
	int k = search(a, 7);
	cout << k << endl;
	int l = search(b, 5);
	cout << l<< endl;
}