Question

Code in C - CountingSort exact as the algorithm which takes in an array of 1000 random integers. Provide comments in code for understanding purpose

COUNTING-SORT(A, B, k) 1 let C[0..k] be a new array 2 for i = 0 to k C[i] = 0 4 for j = 1 to A.length 5 C[Ajl] = C[A;l] + 1 6 / C[i] now contains the number of elements equal to i. 7 for i = 1 tok C[i] = C[i] + C[i – 1] 9 // Clinow contains the number of elements less than or equal to i. 10 for j = A.length downto 1 11 B[CAT]]] = A[j] C[Ail] = C[Aill - 1

Answer 1

//C program

#include<stdio.h>
#include<time.h>
#define n 1000

//counting sort function
void countSort(int A[] , int B[] , int k){
   int i;
   int C[k+1];
   for(i=0;i<=k;i++) C[i] = 0;
  
   for(i=0 ;i<n;i++)C[A[i]] = C[A[i]] + 1;
  
   for(i=1;i<=k;i++)C[i] = C[i] + C[i-1];
  
   for(i = n-1;i>=0;i--){
       B[C[A[i]]-1] = A[i];
       C[A[i]] = C[A[i]] -1;
   }

}
//max() function return maximum element in array A[]
int max(int A[]){
   int m = A[0];
   int i;
  
   for(i=0;i<n;i++){
       if(A[i]>m) m =A[i];
   }
   return m;
}

//Driver main function
int main(){

   int A[n],B[n];
   int i=0;
   srand(time(NULL));
  
   //Array initialization using random numbers
   for(i=0;i<n;i++){
       A[i] = rand()%1000;
   }
  
   printf("Unsorted Array : \n");
   //printing unsorted array
   for(i=0;i<n;i++)printf("%d ",A[i]);
  
   int k = max(A);
   //calling countSort() function to sort array A[] and put sorted element int array B[]
   countSort(A,B,k);
   printf("\nsorted Array : \n");
   //printing sorted array B[]
   for(i=0;i<n;i++)printf("%d ",B[i]);
  
return 0;
}