Startertutorials Blog
Tutorials and articles related to programming, computer science, technology and others.
Subscribe to Startertutorials.com's YouTube channel for different tutorial and lecture videos.

Categories: Arrays. No Comments on C program to reverse an array in place
0
(0)

In this article we will learn to implement a C program to reverse an array in place (without using a temporary array. A C program is provided below to reverse an array in place.

Program is as follows:

#include<stdio.h>
int main()
{
	int array[20];
	int n;
	printf("Enter number of elements: ");
	scanf("%d", &n);
	printf("Enter array elements: ");
	for(int i = 0; i < n; i++)
		scanf("%d", &array[i]);
	for(int i=0, j=n-1; i < j; i++, j--)
	{
		int temp = array[i];
		array[i] = array[j];
		array[j] = temp;
	}
	printf("Reversed array elements are: ");
	for(int i = 0; i < n; i++)
		printf("%d ", array[i]);
	return 0;
}

 

Input and output for the above program is as follows:


Subscribe to our monthly newsletter. Get notified about latest articles, offers and contests.


Enter number of elements: 5
Enter array elements: 12 78 24 13 6
Reversed array elements are: 6 13 24 78 12

 

How useful was this post?

Click on a star to rate it!

We are sorry that this post was not useful for you!

Let us improve this post!

Tell us how we can improve this post?

Suryateja Pericherla

Suryateja Pericherla, at present is a Research Scholar (full-time Ph.D.) in the Dept. of Computer Science & Systems Engineering at Andhra University, Visakhapatnam. Previously worked as an Associate Professor in the Dept. of CSE at Vishnu Institute of Technology, India.

He has 11+ years of teaching experience and is an individual researcher whose research interests are Cloud Computing, Internet of Things, Computer Security, Network Security and Blockchain.

He is a member of professional societies like IEEE, ACM, CSI and ISCA. He published several research papers which are indexed by SCIE, WoS, Scopus, Springer and others.

Leave a Reply

Your email address will not be published. Required fields are marked *