滴水逆向——C++_模板

1、在函数中使用模板

#include<stdio.h>
#include<Windows.h>

template<class T>
void Sort(T arr, int nlength)
{
	for (int n = 0; n < nlength - 1; n++)
	{
		for (int i = 0; i < nlength - 1 - n; i++)
		{
			if (arr[i] > arr[i + 1])
			{
				T temp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = temp;
			}
		}
	}
	
}

template<class T>
void Print(T arr, int nLength)
{
	int i;
	for (i = 0; i < nLength; i++)
	{
		printf("%d\n", arr[i]);
	}
}

template<class T, class E>
int Find(T arr, int nLength, E nElement)
{
	int nBegin = 0, nEnd = nLength - 1, nIndex;

	while (nBegin <= nEnd)
	{
		nIndex = (nBegin + nEnd) / 2;
		if (nElement > arr[nIndex])
		{
			nBegin = nIndex + 1;
		}
		else if (nElement < arr[nIndex])
		{
			nEnd = nIndex - 1;
		}
		else
		{
			return nIndex;
		}
	}
	return -1;
}

int main(int argc, char* argv[])
{

	int ar