Yeah, that's a bunch of code. Given length = the size of the array:
// Print it forwards
for(int i=0; i<=length; ++i)
cout << array[i];
// Print it backwards
for(int i=length; i>=0; --i)
cout << array[i];
You know what, I might have misread your post. Was it just PRINTING them in different order or was it to change the ACTUAL array? My bad if it was the latter.
You might have been able to do the swap in the for loop too; it may have needed 2 for loops based on odd or even number of elements in the array (not sure unless I REALLY code it), but:
// Not sure if k=lenght is valid; been a while since I did C
for(int i=0; i<=length,k=length; ++i
{
int temp = array[i];
array[i] = array[k];
array[k] = temp;
--k;
}
If you get bored on break, do it your way with the call to the exchange procedure and my way with 1 or 2 for loops. Do it for an array of a million items. Time it
That's when Computer Science gets fun; you may find the overhead to call your procedure really slows the program down on a huge array.