Question

2. Consider the following unordered list: 2,4,8, 4, 4, 3, 2, 9, 2, 5, 2, 5, 2 Apply the distribution counting sort algorithm to sort this list in ascending (non-decreasing order). Show the frequencies and the distribution values as the correct sorted-order indexes are calculated. (20 points)

Answer 1

//C++ Code:-

#include<iostream>
using namespace std;

// Function to sort the array and update the freq array.
void counting_sort(int a[],int n,int freq[])
{
for(int i=0;i<n;i++)
freq[a[i]]++;
int k=0;
for(int i=0;i<10;i++)
{
if(freq[i])
{
for(int j=0;j<freq[i];j++)
a[k++]=i;
}
}
}
int main()
{
// Define array with some value.
int a[]={2,4,8,4,4,3,2,9,2,5,2,5,2};
  
// Calculating size of an array.
int n=sizeof(a)/sizeof(a[0]);
  
// Array for counting Frequency of each value.
int freq[10]={0};
  
// Calling function to sort the array.
counting_sort(a,n,freq);
  
//Print the Sorted array.
cout<<"The sorted array : ";
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
  
// Print Distributed_Value and their corrosponding Frequency.
cout<<"Distributed_Value Frequency"<<endl;
for(int i=0;i<10;i++)
{
if(freq[i])
cout<<i<<" "<<freq[i]<<endl;
}
return 0;
}

10 { { main.cpp 1 #include<iostream> 2 using namespace std; 3 4 // Function to sort the array and update the freq array. 5 void counting_sort(int a[], int n, int freq[]) 6 { 7 for(int i=0;i<n;i++) 8 freq[a[i]]++; 9 int k=0; for(int i=0;i<10; i++) 11 12 if(freq[i]) 13 14 for(int j=0; j<freq[i];j++) 15 a[k++]=i; 16 17 } 18 } 19 int main() 20 { 21 // Define array with some value. 22 int a[]={2,4,8,4,4,3,2,9,2,5,2,5,2}; 23 24 // calculating size of an array. 25 int n=sizeof(a)/sizeof(a[0]); 26 27 // Array for counting Frequency of each value. 28 int freq[10]={@}; 29 30 // Calling function to sort the array. 31 counting_sort(a,n, freq); 32 }

2 33 34 35 36 37 //Print the Sorted array. cout<<"The sorted array : "; for(int i=0;i<n;i++) cout<<a[i]<<" "; cout<<endl; 38 39 40 41 // Print Distributed_value and their corrosponding Frequency. cout<<"Distributed_value Frequency"<<endl; for(int i=0;i<10;i++) 42 { if(freq[i]) cout<<i<<" "<<freq[i]<<endl; 43 44 45 46 47 } } return 0; input The sorted array : 2 2 2 2 2 3 4 4 4 5 5 8 9 Distributed_value Frequency 2 5 3 1 4 3 5 2 8 1 9 1 ..Program finished with exit code 0 Press ENTER to exit console.]