Write a C++ program to declare and initialize the following array: int array[] = { 14, -23, 44, -79, 52, 6 }; Now add code to the program that uses a loop to exchange the outermost pair of element values, then the next interior pair, and so on until the innermost pair of values is exchanged. Write the program so that it is not sensitive to the number of elements in the array and test it on an integer array that contains an odd number of elements. Your program may not have more than one array. You may use a temp variable in the swapping process. The program output should be similar to the following: original array (element 0 first): 14 -23 44 -79 52 6 array after exchange (element 0 first): 6 52 -79 44 -23 14 NOTE: you can determine the number of elements in an array with the following: int array[] = { 14, -23, 44, -79, 52, 6 }; int x; x = sizeof(array) / sizeof(array[0]); // sizeof is a function in iostream.h Use the sizeof() function to determine the number of elements in any arrays that are initialized before compilation in all the following assignments. The program name should be: PROG17.cpp

this program just flipped it put 6 52 -79 44 -23 12

this is the program im using

#include using namespace std; int main() { int i,j,temp,x; int array[] = { 14, -23, 44, -79, 52, 6 }; x = sizeof(array) / sizeof(array[0]); j = x - 1; i = 0; cout<<"original array (element 0 first): "; for(int k=0;k

while (i < j) { temp = array[i]; array[i] = array[j]; array[j] = temp; i++; j--; } cout<<" array after exchange (element 0 first): "; for(int k=0;k

}