C primre plus Chapter 10 question 6 inverted array

Write a function , hold int The data in the type array is arranged in reverse order , And test the function in a simple program .

If you don't open an additional array , The code is as follows ：( But there may be a better algorithm ？)

#include <stdio.h>
#define SIZE 12

void reverse(int * a, int n);
int main(void)
{
	int a[SIZE] = {3, 4431, 43, 23, 35, 35, 1, 34, 234, 35, 3, 1 };
	int i = 0;
	
    reverse(a, SIZE);
	for(i = 0; i < SIZE; i++)
	{
		printf("a[%d]  ", i);
	 } 
	 printf("\n"); 
	 for(i = 0; i < SIZE; i++)
	{
		printf("%-6d", a[i]);
	 } 
	
	return 0;
}

void reverse(int * a, int n)
{
	int i = 0;
	int j = n - 1;
	int temp;
	
	for(; i < j; i++, j--)
	{
		temp = a[j];
		a[j] = a[i];
		a[i] = temp;
	}
	return;
}