Thread: arrays and pointers

what will be the contents of the array SORT after the following statements are done??

Code:

#define ELEMENTS 7

int SORT[ELEMENTS] = {2,4,6,8,10,12,14};
int *s = &SORT[0], *t = &SORT[ELEMENTS -1], temp;

while (s < t) 

{    temp = *s;
      *s++ = *t;
      *t-- = temp;
}

I think the contents are unchanged.
Is that correct??

Or is this a trick question, and the contents are reversed??

They are reversed. The last element becomes the first and the first becomes the last, etc.

before swap: 2, 4, 6, 8, 10, 12, 14

after swap: 14, 12, 10, 8, 6, 4, 2


No more homework questions.

I am just trying to understand the question??
pointers are a bugger to get and C depends on knowing
arrays and pointers.

Stoned Coder ---------

Thanks for the step by step, however,

The original question was:

what will be the contents of the array SORT after the following statements are done??

And my thought was either the answer is the obvious, the elements are reversed as that is what the WHILE loop will do
OR this is a trick sort of question, because the actual elements of the original array are not really changed in order. Just the pointer is pointing to the elements in a different order. Do you see what I mean???