练习：模板函数，用来测试数组中的元素是否按升序排列

/*-----------------------------------------------------
试编写一个模板函数，用来测试数组 a中的元素是否按升序排列（即 a [ i ]≤a [ i + 1 ] ,其中0≤
i＜n - 1） 。如果不是，函数应返回f a l s e，否则应返回t r u e。上机测试该函数。
--------------------------------------------------------------*/


#include <iostream>
#include <array>
using namespace std;


template <class T>
bool Arrange(array<T, 8> s)
{
	int i = 0, n = 8;
	for (; i < n-1; i++)
	{
		if (s[i] <= s[i+1])
			continue;
		else
			return cout << "False" << endl;
	}
	return cout << "True" << endl;
}


int main()
{
	int i = 0;
	array<int, 8> a;
	while (i < 8)
	{
		cin >> a[i];
		i++;
	}
	Arrange(a);
	return 0;
}




/*
#include <iostream>
#include <array>
using namespace std;


template <class T>
bool Arrange(array<T, 8> s)
{
	int i = 0, n = 8;
	for (; i < n-1; i++)
	{
		if (s[i] <= s[i+1])
			continue;
		else
			return cout << "False" << endl;
	}
	return cout << "True" << endl;
}


int main()
{
	array<int, 8> a = {1, 22, 33, 42, 15, 54, 11, 35};
	Arrange(a);
	return 0;
}*/


/*
#include <iostream>
using namespace std;


template <class T>
bool Arrange(T &s)
{
	int i = 0, n = 8;
	for (; i < n-1; i++)
	{
		if (s[i] <= s[i+1])
			continue;
		else
			return cout << "False" << endl;
	}
	return cout << "True" << endl;
}


int main()
{
	int a[] = {1, 22, 33, 42, 15, 54, 11, 35};
	Arrange(a);
	return 0;
}
*/


/*
#include <iostream>
using namespace std;


template <class T>
bool Arrange(T s[])
{
	int i = 0, n = 8;
	for (; i < n-1; i++)
	{
		if (s[i] <= s[i+1])
			continue;
		else
			return cout << "False" << endl;
	}
	return cout << "True" << endl;
}


int main()
{
	int a[8] = {1, 22, 33, 42, 15, 54, 11, 35};
	Arrange(a);
	return 0;
}
*/