Inverse of an array in C - DS TUTORIAL

how to inverse an array in c language. There are three function in this given example one for reading the array element, second for writing on console and last for inverse of an array.

Code:

#include<stdio.h>
#include<conio.h>
void main()
 {
  void read(int *,int);
 void   display(int *,int);
 void  inverse(int *,int);

 int a[6],i;
 clrscr();
 read(a,6);
 display(a,6);
 inverse(a,6);
 display(a,6);
 getch();
 }

 void read(int c[],int i)
  {
 int j;
 printf("Enter six element for an array \n");
 for(j=0;j<i;j++)
 scanf("%d",&c[j]);
  }
  void display(int d[],int i)
  {
 int j;
 printf("Element in array are : \n");
 for(j=0;j<i;j++)
 printf("%d  ",d[j]);
 printf("\n");
  }
 void inverse(int x[],int k)
 {
  int i,temp;
  k--;
  for(i=0;i<(k/2);i++)
 {
  temp=x[i];
  x[i]=x[k];
  x[k]=temp;
  k--;
 }
  }

Output:

Previous - Addition of two arrays element in C

     Next - Merge of two arrays in C

 Data Structure Tutorial 

1.  Introduction to Data Structures
2.  Pointer in C 
3.  Pointer and Structure in C
4.  Linear and Non-Linear Data Structure in C
5.  Array Implementation in C
6.  Sum of array element in C
7.  Addition of two arrays element in C
8.  Inverse of an array in C
9.  Merge of two arrays in C 
10.Overview of Linked List
11.Singly Linked List
12.Doubly Linked List
13.Circular Linked List
14.Count number of nodes
15.Split a list into two equal size list
16.Merge two list into a single list
17.Stack
18.Push and Pop operation of stack.
19.Push and Pop operation of stack using linked list.
20.Queue implementation using array.
21.Queue implementation using linked list.
22.Circular queue implementation using array.
23.Tree data structure
24.Representing Graph using adjacency list & perform DFS & BFS