Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 12

Write a program for display values reverse order from array using pointer.

#include <stdio.h> 
void main()
{
int n, i, arr1[15]; int *pt;
clrscr();
printf("\n\n Pointer : Print the elements of an array in reverse order :\n"); 
printf(" \n");

printf(" \n Enter the size of an array:\n "); 
scanf("%d",&n);
pt = &arr1[0]; // pt stores the address of base array arr1 
printf("\n Enter %d integers into array: \n",n);
for(i=0;i<n;i++)
{
printf("\n Element : %d is:",i+1); 
scanf("%d",pt);//accept the address of the value 
pt++;
}
pt = &arr1[n - 1];
printf("\n The elements of array in reverse order are :"); 
for (i = n; i > 0; i--)
{
printf("\n Element : %d is:%d", i, *pt); 
pt--;
}
printf("\n\n"); 
getch();
}

OUTPUT:

Pointer : Print the elements of an array in reverse order :
 
 Enter the size of an array:
 5
 Enter 5 integers into array: 

 Element : 1 is:45
 Element : 2 is:13
 Element : 3 is:21
 Element : 4 is:32
 Element : 5 is:62
 The elements of array in reverse order are :
 Element : 5 is:62
 Element : 4 is:32
 Element : 3 is:21
 Element : 2 is:13
 Element : 1 is:45

Comments

Popular posts from this blog

EAMCET and ECET Web Options Guidance For Data Science, AI and Machine Learning.

EAMCET and ECET WEB OPTIONS GUIDANCE   Data Science, AI ,Machine Learning and CSE:  These NEW courses are trending now and according to the research these courses are having  tremendous  future in coming days. All these branches are sub branches of CSE and now it became separate Technologies. For video explanation click on  click here                Branch Name                                                                      Branch code 1. CSE(Artificial Intelligence and Machine Learning)                                            CSM 2. CSE...

INSERTION SORT, BUBBLE SORT, SELECTION SORT

// C program for insertion sort #include <math.h> #include <stdio.h> void insertionSort(int arr[], int n);     // A utility function to print a sorted array of size n void printArray(int arr[], int n) {     int i;     for (i = 0; i < n; i++)         printf("%d ", arr[i]);     printf("\n"); }    // Driver code int main() {     int arr[15],n,i;         printf("enter number of elements in array \n");     scanf("%d", &n);         printf("enter array values to sort\n");     for(i=0; i<n; i++)     scanf("%d", &arr[i]);         insertionSort(arr, n);     printArray(arr, n);        return 0; } /* Function to sort an array using insertion sort*/ void insertionSort(int arr[], int n) {     int i, key, j;     for (i = 1; i < n; i++) ...