#include <iostream> using namespace std; //编写一个函数模板,用来测试数组a中的元素是否按升序排列 template <typename T> bool isAsd(T a[], int n) { bool result = true; for (int i = 0; i < n - 1 && result; i++) { if (a[i] > a[i+1]) result = false; } return result; } //编写一个递归函数来确定x是否属于数组a[0:n-1]. template <typename T> bool isExist(T a[], int n, T x) { if (n > 1) return isExist(a, n-1, x) || (a[n-1] == x); return a[0] == x; } int main(void) { int a[4]; for (int i = 0; i < 4; i++) cin >> a[i]; for (int i = 0; i < 4; i++) cout << a[i] << " "; cout << endl; cout << isAsd(a, 4) << endl; cout << isExist(a, 4, 3) <<endl; return 0; }