pc-ip-10.c ​
Metadata ​
- Author — Amit Dutta
- Last updated — 05 Jan 2026
- License — MIT License (See the LICENSE file for details)
Problem Statement ​
Problem Statement
Question 10: Write a function that reverses each elements of an array in place, using only a single pointer argument, and return void.
Source Code ​
Printing the code
To print this file, open it on GitHub and click Raw before printing, or use the Download Raw button above and print directly from that page.
c
#include <stdio.h>
#include <stdlib.h>
void inputArray(int[], int);
void printArray(int[], int);
void reverse(int *);
int main()
{
int n, i, *arr = NULL;
printf("Enter the number of element: ");
scanf("%d", &n);
arr = (int *)malloc(n * sizeof(int));
if (arr == NULL)
{
printf("\nMemory allocation failed.");
return 1;
}
inputArray(arr, n);
printf("\nGiven Array: ");
printArray(arr, n);
for (i = 0; i < n; i++)
{
reverse(&arr[i]);
}
printf("\nUpdated Array: ");
printArray(arr, n);
free(arr);
return 0;
}
void inputArray(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
{
printf("Enter element %d: ", i + 1);
scanf("%d", &arr[i]);
}
}
void printArray(int arr[], int n)
{
int i;
printf("[");
for (i = 0; i < n; i++)
{
printf("%d", arr[i]);
if (i < n - 1)
{
printf(", ");
}
}
printf("]");
}
void reverse(int *n)
{
int temp = *n;
int rev = 0;
while (temp > 0)
{
rev = (rev * 10) + (temp % 10);
temp /= 10;
}
*n = rev;
}1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67