Question

Implement the sort procedure from Assignment 18 as a void function. Pass the address of the first array element to the function along with the number of elements in the array. Use pointers in your function to reference the array elements. The sort function should do nothing but sort the elements of the array. DO NOT pass the entire array as an argument to the function. As in Assignment 18, print out the array before and after sorting. Use the same test data. All output should be in main(), not in the function. Prog18:Consider the following sort procedure written in pseudo code: Exchange Sort of Array X[] For I = 0 to (number of array elements - 2), increment by 1 For J = (I + 1) to (number of array elements - 1), increment by 1 If X[I] is greater than X[J] then temp = X[I] X[I] = X[J] X[J] = temp Next J Next I Implement the sort procedure in main() without using pointers. Declare the array as follows using the test data shown: int x[] = { 28, 87, -3, 45, 19 }; Use a for loop to print out the array before sorting and again after sorting. There should be no output within the sort procedure.

Answer 1

#include<iostream.h>
#include<conio.h>
void sort(int*[],int); //function declaration

void sort(int *a[],int x) //sort function definition
{
int temp;
for (int i=0;i<x;i++)

{
for(int j=i+1;j<x;j++)
{
if(*a[i]>*a[j])
{
temp=*a[i];
*a[i]=*a[j];
*a[j]=temp;
}

}
}

}

void main()

{
clrscr();
int *p=0;
int arr[20],n,tmp;
cout<<"Enter the array size: ";
cin>>n;
cout<<"Enter array elements:\n"; //input for array
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout<<"so our array before sort is:\n"; //array before sorting
for(int j=0;j<n;j++)
{
cout<<arr[j]<<" ";
}
cout<<"\n";
p=&arr[0];

sort(&p,n); //passing first element of array as reference and size

for(int k=0;k<n;k++) //sorting procedure
{
for(int l=k+1;l<n;l++)
{
if(arr[k]>arr[l])
{
tmp=arr[k];
arr[k]=arr[l];
arr[l]=tmp;
}
}
}

cout<<"Now the array after sorting process is: "; //printing sorted array
for(int m=0;m<n;m++)
{
cout<<arr[m]<<" ";
}
cout<<"\n";
}

OUTPUT:

ile Edit Search Run Is1 Enter the array size: 5 Enter array elements: 28 87 -3 45 19 so our array before sort is: 28 87-3 45 19 Output Nou the array after sorting process is: -3 19 28 15 87