Answer:
C++.
Explanation:
int arr[] = {1, 4, 6, 5, 2, 7, 10};
///////////////////////////////////////////////////////////////////////////////
// Methods
int searchValue(int arr[], int n, int value) {
int* pointerArray = arr;
for (int i = 0; i < n; i++) {
if (*(pointerArray + i) == value) {
delete[] pointerArray;
return i;
}
}
delete[] pointerArray;
return -1
}
void reverse(int arr[], int n) {
int tempArr[n] = arr;
int* pointerArray = arr
int* pointerArray2 = tempArr;
for (int i = 0; i < n; i++) {
*(pointerArray2 + i) = *(pointerArray + ((n-1) - i));
}
arr = tempArr;
delete[] pointerArray, pointerArray2;
}
void oddFirst(int arr[], int n) {
int* pointerArray = arr;
int count = 0;
for (int i = 0; i < n; i++) {
if ((*(pointerArray + i) % 2) != 0) {
int temp = *(pointerArray + i);
*(pointerArray + i) = *(pointerArray + count);
*(pointerArray + count) = temp;
count++;
}
}
delete[] pointerArray;
}