3. 建立求数组元素中最小值的函数模板。

#include<iostream>
using namespace std;
template<typename T>
T mini(T a[], int num)
{
	if (a == NULL) return -1;
	quick_sort(a, 0, num - 1);
	return a[0];
}
template<typename T>
int min_re(T a[], int left, int right)
{
	T b = a[left];
	while (left < right)
	{
		while (a[right] >= b && right > left)
			right--;
		a[left] = a[right];
		while (a[left] <= b && left < right)
			left++;
		a[right] = a[left];
	}
	a[left] = b;
	return left;
}
template<typename T>
void quick_sort(T a[], int left, int right)
{
	if (left < right)
	{
		int mid = min_re(a, left, right);
		quick_sort(a, left, mid - 1);
		quick_sort(a, mid + 1, right);
	}
}
int main()
{
	int  num;
	cin >> num;
	int* p = new int[num];
	char* a = new char[num];
	for (int i = 0; i < num; i++)
	{
		cin >> p[i];
	}
	for (int i = 0; i < num; i++)
	{
		cin >> a[i];
	}
	cout << mini(a, num)<<"  ";
	cout << mini(p, num);
	return 0;
}