Question

1. Write a function that gets an array as a parameter, sorts it in a descending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position).

int sortDESC(int* myArray, int size)

if array = { 2, 3, 1, 0, -1} after calling the function the array should become

{-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array)

Hint: 1.You need to make a copy of the array before sorting it!

2. and the answer need to include output

Answer 1

Note: Here if we sort in ascending order then we get the output as shown in Question.

Required Function:

int sortDESC(int* myArray,int size)
{
   int orgArray[size];
   int i=0,j=0,temp=0;
   for(i=0;i<size;i++)
       orgArray[i]=myArray[i] ; // array copying

   for(i=0;i<size-1;i++)
   {
       for(j=i+1;j<size;j++)
       {
           if(myArray[i]>myArray[j]) // sorting the array in descending order
           {
               temp=myArray[i];
               myArray[i]=myArray[j];
               myArray[j]=temp;
           }
       }
   }
   int count=0;
   for(i=0;i<size;i++)
       if(myArray[i]==orgArray[i])
           ++count;

   return count;
}

Complete Source Code:

#include <stdio.h>
int sortDESC(int* myArray,int size)
{
   int orgArray[size];
   int i=0,j=0,temp=0;
   for(i=0;i<size;i++)
       orgArray[i]=myArray[i] ; // array copying

   for(i=0;i<size-1;i++)
   {
       for(j=i+1;j<size;j++)
       {
           if(myArray[i]>myArray[j]) // sorting the array in descending order
           {
               temp=myArray[i];
               myArray[i]=myArray[j];
               myArray[j]=temp;
           }
       }
   }
   int count=0;
   for(i=0;i<size;i++)
       if(myArray[i]==orgArray[i])
           ++count;

   return count;
}
int main()
{
   int size=5;
   int array[]={2,3,1,0,-1};
   int res=sortDESC(array,size);
   printf("No. of unchanged elements:%d\n",res);
}

{ 11 { 1 #include <stdio.h> 2 int sortDESC(int* myArray,int size) 3 { 4 int orgArray[size]; 5 int i=0,j=0, temp=0; 6 for(i=0;i<size; i++) 7 orgArray[i]=myArray[i] ; // array copying 8 9 for(i=0;i<size-1; i++) 10 for(j=i+1;j<size; j++) 12 13 if(myArray[i]>myArray[j]) // sorting the array in descending order 14 { 15 temp=myArray[i]; 16 myArray[i]=myArray[j]; 17 myArray[j]=temp; 18 19 20 21 int count=0; 22 for(i=0;i<size; i++) 23 if(myArray[i]==orgArray[i]) 24 ++count; 25 26 return count; 27 } 28 int main() 29 { int size=5; 31 int array[ ]={2,3,1,0,-1}; 32 int res=sortDESC(array, size); 33 printf("No. of unchanged elements:%d\n", res); 34 } } } } 30
Sample input and output:

(base) rgukti@rgukt-TravelMate-P243-M:-/Desktop$ ./a.out No. of unchanged elements: 1 (base) rgukti@rgukt-TravelMate-P243-M:-/Desktops I