If the goal is to reverse that array in-place, then you really want to stop at size/2 instead of size in that for loop.
Inside the loop, using a int temporary variable, swap the contents of array[i] with array[size-1-i]:
int temp = array[i];
array[i] = array[size-1-i]
array[size-1-i] = temp;
If you run that with i ranging from 0 to size-1, then you will reverse the array twice, leaving it in the original order. Not good.
for (i=0; i
for (i=size/2 - 1; i>=0; --i) .... this works too
The second version avoids computing and storing size/2 for comparison. Older, unoptimized compilers would compute size/2 on every iteration of the loop.
Also, you might occasionally see (size>>1) instead of size/2. Shifts are faster than division, and C/C++ compilers can't optimize signed integer division by 2 into shifts because of the bonehead rounding modes that ISO/ANSI chose.
For now, just use the first version, and be aware that the others exist. You probably won't have to worry about this sort of micro-optimization, ever.