Skip to main content

Engineering Computer Science EBK DATA STRUCTURES AND ALGORITHMS IN C

Program Plan: 1. Below mentioned variables are used sizeofarray- which is actually the size of input given by the user. array[]- which has the series of data to be sorted count[]- Array that stores the number of occurrences of each element in the input. max -the variable that has the value of a greater number while comparing two numbers. exp - Exponent of the digit in the current array element. output[]- Has the sorted elements, which is actually the output array. 2. Below Mentioned functions are used cSort()-performs the actual countingsort algorithm . maxNum()-finds the greatest element in the given input array. displayArray()- to display the output. radSort()- finds the exponent of every digit and sorts the numbers using counting sort. main()- Main function for the program which gets the input and calls msort() function. Program description: This program is for implementing the bit radix sort using the counting sort algorithm in every pass. In the Counting sort algorithm,the largest number in the input array is calculated first and then occurrences of every element in the array are then calculated and stored in the count[] array. The cumulative frequency is calculated for array count[] and then the elements are sorted based on their index in count[] array. Here instead of passing numbers to cSort() function the exponent of every digit in the array element is passed for cSort(). Algorithm Get the input array[] Call radSort() Find the greatest element in array[] Find the exponent of every digit and pass it as an argument for cSort() cSort() Createcount[] with sizeof(array[])+1 Initialize all the elements in count[] to 0 Find the number of occurrences of every element in array[] and enter the number of occurrences in count[] Find the cumulative frequency for all the occurrences in count[] Store the elements in output[] such that the index of exponent of ith element of array[] in count[] is equal to ith element in array[] Decrease the count of same numbers in count[] Return to radSort() Return to main() Display the output Program: #include <iostream> using namespace std; int maxNum(int array[], int sizeofarray) { int max = array[0]; for (int i = 1; i<sizeofarray; i++) if (array[i] > max) max = array[i]; return max; } void cSort(int array[], int sizeofarray, int exp) { int output[sizeofarray]; // output array int i, count[10] = { 0 }; for (i = 0; i<sizeofarray; i++) count[(array[i] / exp) % 10]++; for (i = 1; i< 10; i++) count[i] += count[i - 1]; for (i = sizeofarray - 1; i>= 0; i--) { output[count[(array[i] / exp) % 10] - 1] = array[i]; count[(array[i] / exp) % 10]--; } for (i = 0; i<sizeofarray; i++) array[i] = output[i]; } void radSort(int array[], int sizeofarray) { int max = maxNum(array, sizeofarray); for (int exp = 1; max / exp> 0; exp *= 10) cSort(array, sizeofarray, exp); } void displayArray(int array[], int sizeofarray) { for (int i = 0; i<sizeofarray; i++) cout<< array[i] << " "; } int main() { int array[50], sizeofarray; cout<< "Bit Radix Sort using Counting Sort"<<endl; cout<< "Enter the number of elements to be sorted" <<endl; cin>>sizeofarray; cout<< "Enter the elements for sorting"<<endl; for(int i=0; i<sizeofarray; i++) { cin>> array[i]; } radSort(array, sizeofarray); displayArray(array, sizeofarray); return 0; } Output: Explanation: Bit Radix sort using Counting sort in each pass is implemented in this program. The function radSort() initially calculates the exponent of each and every digit of an element in the input and performs counting sort for every element in the array.

Program Plan: 1. Below mentioned variables are used sizeofarray- which is actually the size of input given by the user. array[]- which has the series of data to be sorted count[]- Array that stores the number of occurrences of each element in the input. max -the variable that has the value of a greater number while comparing two numbers. exp - Exponent of the digit in the current array element. output[]- Has the sorted elements, which is actually the output array. 2. Below Mentioned functions are used cSort()-performs the actual countingsort algorithm . maxNum()-finds the greatest element in the given input array. displayArray()- to display the output. radSort()- finds the exponent of every digit and sorts the numbers using counting sort. main()- Main function for the program which gets the input and calls msort() function. Program description: This program is for implementing the bit radix sort using the counting sort algorithm in every pass. In the Counting sort algorithm,the largest number in the input array is calculated first and then occurrences of every element in the array are then calculated and stored in the count[] array. The cumulative frequency is calculated for array count[] and then the elements are sorted based on their index in count[] array. Here instead of passing numbers to cSort() function the exponent of every digit in the array element is passed for cSort(). Algorithm Get the input array[] Call radSort() Find the greatest element in array[] Find the exponent of every digit and pass it as an argument for cSort() cSort() Createcount[] with sizeof(array[])+1 Initialize all the elements in count[] to 0 Find the number of occurrences of every element in array[] and enter the number of occurrences in count[] Find the cumulative frequency for all the occurrences in count[] Store the elements in output[] such that the index of exponent of ith element of array[] in count[] is equal to ith element in array[] Decrease the count of same numbers in count[] Return to radSort() Return to main() Display the output Program: #include <iostream> using namespace std; int maxNum(int array[], int sizeofarray) { int max = array[0]; for (int i = 1; i<sizeofarray; i++) if (array[i] > max) max = array[i]; return max; } void cSort(int array[], int sizeofarray, int exp) { int output[sizeofarray]; // output array int i, count[10] = { 0 }; for (i = 0; i<sizeofarray; i++) count[(array[i] / exp) % 10]++; for (i = 1; i< 10; i++) count[i] += count[i - 1]; for (i = sizeofarray - 1; i>= 0; i--) { output[count[(array[i] / exp) % 10] - 1] = array[i]; count[(array[i] / exp) % 10]--; } for (i = 0; i<sizeofarray; i++) array[i] = output[i]; } void radSort(int array[], int sizeofarray) { int max = maxNum(array, sizeofarray); for (int exp = 1; max / exp> 0; exp *= 10) cSort(array, sizeofarray, exp); } void displayArray(int array[], int sizeofarray) { for (int i = 0; i<sizeofarray; i++) cout<< array[i] << " "; } int main() { int array[50], sizeofarray; cout<< "Bit Radix Sort using Counting Sort"<<endl; cout<< "Enter the number of elements to be sorted" <<endl; cin>>sizeofarray; cout<< "Enter the elements for sorting"<<endl; for(int i=0; i<sizeofarray; i++) { cin>> array[i]; } radSort(array, sizeofarray); displayArray(array, sizeofarray); return 0; } Output: Explanation: Bit Radix sort using Counting sort in each pass is implemented in this program. The function radSort() initially calculates the exponent of each and every digit of an element in the input and performs counting sort for every element in the array.

Solution Summary: The author describes the program for implementing the bit radix sort using the counting sort algorithm in every pass.

EBK DATA STRUCTURES AND ALGORITHMS IN C

EBK DATA STRUCTURES AND ALGORITHMS IN C

4th Edition

ISBN: 9781285415017

Author: DROZDEK

Publisher: YUZU

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

Blurred answer

Chapter 9, Problem 20E

Chapter 9, Problem 1PA

Students have asked these similar questions

The optimised bubble sort offers none of the following benefits over conventional sorts for items that have already been sorted.

Write bubble sort pseudo code

On the following groups, track the insertion sort passes:i) {H, K, M, N, P} ii) {P, N, M, K, H}Regarding the comparisons made, evaluate their work.

Chapter 9 Solutions

EBK DATA STRUCTURES AND ALGORITHMS IN C

Ch. 9 - Prob. 7E Ch. 9 - Prob. 9E Ch. 9 - Prob. 10E Ch. 9 - Prob. 11E Ch. 9 - Prob. 12E Ch. 9 - Prob. 13E Ch. 9 - Prob. 14E Ch. 9 - Prob. 16E Ch. 9 - Prob. 18E Ch. 9 - Prob. 20E

Ch. 9 - Prob. 21E Ch. 9 - Prob. 1PA Ch. 9 - Prob. 2PA Ch. 9 - Prob. 3PA Ch. 9 - Prob. 4PA Ch. 9 - Prob. 5PA

Knowledge Booster

Background pattern image

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you

Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

Text book image

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

SEE MORE TEXTBOOKS