path: root / Sem. 06 / Solutions / exercise01.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

#include <iostream>

using namespace std;

bool isPalindromeArray(int nums[], int len) {
	for (int i = 0; i < len / 2; i++) {
		if (nums[i] != nums[len - 1 - i])
			return false;
	}
	return true;
}

int main() {
	int numbers[5] = { 1, 2, 3, 2, 1 };

	cout << isPalindromeArray(numbers, 5) << endl;
}