Question

C programming Strictly -

Problem 1 (68 points): Write a program to sort an array of integers via arrays of pointers to those integers as shown in the figure. The code should contain the following functions: 1)to randomly generate an array of integer numbers; 2) to allocate memory and build the arrays of pointers as shown in the figure (two such arrays are required); 3) to sort one of the arrays of pointers to point to the integer numbers in ascending order (must use recursive selection sort from Homework 4): 4) to sort one of the arrays of pointers to point to the integer numbers in descending order (must use recurs ve insertion sort from Homework 4): 5) to print the array of integers as shown in the bottom figure. Implement pass by reference and pass by value as appropriate.

Write a program to sort an array of integers via arrays of pointers to those integers as shown in the figure.

Answer 1

Code in C

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <stdio.h>

#include <string.h>

#include <time.h>

void recursiveInsertionSort(int *arr[], int n)

{

int j,key;

if(n<=0)

return;

   else {

recursiveInsertionSort(arr,n-1);

key=*(arr[n]);

int *ar = arr[n];

j=n-1;

   while(j>=0 && *(arr[j])<key)

{

arr[j+1]=arr[j];

j--;

}

arr[j+1]=ar;

}

}

void swap(int *x, int *y) {

   int temp = *x;

   *x = *y;

   *y = temp;

}

int findMax(int *a[],int n) {

   int max;

   if (n == 0)

return 0;

   max = findMax(a,n-1);

   if (*(a[n]) >*(a[max]))

   return n;

   return max;

}

void selectionSort(int *a[],int n) {

   int maxnumber;

if(n<=0)

   return;

else{

maxnumber = findMax(a,n);

swap(a[maxnumber], a[n]);

selectionSort(a,n-1);

   }

}

int main()

{

srand(time(NULL));

int n;

printf("Enter the size of Integer Array\n");

scanf("%d",&n);

int *arr = (int *)malloc(n*sizeof(int));

int *temp = (int *)malloc(n*sizeof(int));

for(int i=0;i<n;++i){

arr[i] = rand()%101;

temp[i] = arr[i];

}

int *ascendingptr[n];

int *descendingptr[n];

for(int i=0;i<n;++i)

ascendingptr[i] =(arr+i);

selectionSort(ascendingptr,n-1);

for(int i=0;i<n;++i)

descendingptr[i] = (arr+i);

recursiveInsertionSort(descendingptr,n-1);

printf("Ascending\tOrignal\tDescending\n");

for(int i=0;i<n;++i)

   printf("\n%d\t \t%d \t \t%d " ,*( ascendingptr[i]),temp[i], *( descendingptr[i]));

}

===================================================================================
Adding Image for more Clarity:

include <stdio.h> #incLude <stdlib.h> #incLude <string.h> #incLude <stdio.h> #incLude <string.h> #incLude «time.h> void recursiveInsertionSort(int *arr[], int n) int j,key; if (n<-0) return; else t recursiveInsertionSort(arr,n-1); key-*(arr[n]); int *ar- arr[n]; while(j>-0 && *(arr[j])<key) arr[j+1]-ar; void swap(int *x, int y) int tempx *ytemp; int findMax(int *a[],int n) f int max; return 0; max - findMax (a,n-1); if (*(a[n]) >(a [max])) return n; return max; void selectionSort(int a[,int n) int maxnumber; if (n<-0) return; elset maxnumber findMax(a,n); swap(a[maxnumber], a[n]); selectionSort(a,n-1);

int main) srand time (NULL)) int n; printf "Enter the size of Integer Array\n") scanf ("%d",&n) ; int *arr = (int *)malloc(n*sizeof(int)); int *temp-(int *)malloc(n*sizeof(int)); for(int i-0;i<n;++i) arr[i] = rand ()%101; templilarrlil; int ascendingptr[n]; int *descendingptrInl; for(int i-0;i<n;++i) ascendingptrlil(arrti) selectionSort (ascendingptr,n-1); for(int i-0; i<n;++i) recursiveInsertionSort (descendingptr,n-1) printf("Ascending\torignalltDescending\n"); descendingptr[il- (arr+i): for(int i-0; i<n;++i) printf("\n%d\t ascendingpt r [1] ),temp [1], descendingptr[1])); .. \ted ted ,x( *(
Note: I have used rand()%100 --> which will generate random numbers between 0 -100 , Increase this value for larger value of n to get uniform disribution with less duplicates

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <stdio.h>

#include <string.h>

#include <time.h>

void recursiveInsertionSort(int *arr[], int n)

{

int j,key;

if(n<=0)

return;

   else {

recursiveInsertionSort(arr,n-1);

key=*(arr[n]);

int *ar = arr[n];

j=n-1;

   while(j>=0 && *(arr[j])<key)

{

arr[j+1]=arr[j];

j--;

}

arr[j+1]=ar;

}

}

void swap(int *x, int *y) {

   int temp = *x;

   *x = *y;

   *y = temp;

}

int findMax(int *a[],int n) {

   int max;

   if (n == 0)

return 0;

   max = findMax(a,n-1);

   if (*(a[n]) >*(a[max]))

   return n;

   return max;

}

void selectionSort(int *a[],int n) {

   int maxnumber;

if(n<=0)

   return;

else{

maxnumber = findMax(a,n);

swap(a[maxnumber], a[n]);

selectionSort(a,n-1);

   }

}

int main()

{

srand(time(NULL));

int n, i;

printf("Enter the size of Integer Array\n");

scanf("%d",&n);

int *arr = (int *)malloc(n*sizeof(int));

int *temp = (int *)malloc(n*sizeof(int));

for(i=0;i<n;++i){

arr[i] = rand()%101;

temp[i] = arr[i];

}

int *ascendingptr[n];

int *descendingptr[n];

for(i=0;i<n;++i)

ascendingptr[i] =(arr+i);

selectionSort(ascendingptr,n-1);

for( i=0;i<n;++i)

descendingptr[i] = (arr+i);

recursiveInsertionSort(descendingptr,n-1);

printf("Ascending\tOrignal\tDescending\n");

for(i=0;i<n;++i)

   printf("\n%d\t \t%d \t \t%d " ,*( ascendingptr[i]),temp[i], *( descendingptr[i]));

}