Counting shaping
# include & ltstdio.h & gt

//Inverse function

Int reverse(int *num, int count)

{

int i,t;

for(I = 0; I< count/2; ++i)

{

//From 0 bit to half bit of all data, exchange two numbers symmetrical about the midpoint position to achieve the purpose of reverse order.

t = num[I];

num[I]= num[count-I- 1];

num[count-I- 1]= t;

}

}

void main()

{

int i,b[ 10] = { 0, 1,2,3,4,5,6,7,8,9 };

//Call the inverse function

Reverse (b,10);

//output results

for(I = 0; I< 10; ++i)

{

printf("%d ",b[I]);

}

Sleep (10);

}