Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add Radix Sort in C folder #372

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
82 changes: 82 additions & 0 deletions Data Structures and Algorithms/C/RadixSort.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
#include <stdio.h>

int getMax(int arr[], int n);
void countSort(int arr[], int n, int exp);
void radixsort(int arr[], int n);
void print(int arr[], int n);

int main()
{
int n;
printf("Enter the no. of integer numbers in the array: ");
scanf("%d", &n);

printf("Enter the integers: \n");
int arr[n];
for (int i = 0; i < n; ++i)
{
int m = 0;
scanf("%d", &m);
arr[i] = m;
}
radixsort(arr, n);
printf("The sorted array is: \n");
print(arr, n);
return 0;
}

//function to get maximum value in arr[]
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; ++i)
if (arr[i] > mx)
mx = arr[i];
return mx;
}

// A function to do counting sort of arr[] according to
// the digit represented by exp.
void countSort(int arr[], int n, int exp)
{
int output[n];
int i, count[10] = {0};

// Store count of occurrences in count[]
for (i = 0; i < n; ++i)
count[(arr[i] / exp) % 10]++;

// Change count[i] so that count[i] now contains actual
// position of this digit in output[]
for (i = 1; i < 10; ++i)
count[i] += count[i - 1];

// make output array
for (i = n - 1; i >= 0; --i)
{
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}

for (i = 0; i < n; ++i)
arr[i] = output[i];
}

void radixsort(int arr[], int n)
{
// Find the maximum number to know number of digits
int m = getMax(arr, n);

// Do counting sort for every digit. Note that instead
// of passing digit number, exp is passed. exp is 10^i
// where i is current digit number
for (int exp = 1; m / exp > 0; exp *= 10)
countSort(arr, n, exp);
}

// function to print the array
void print(int arr[], int n)
{
for (int i = 0; i < n; ++i)
printf("%d ", arr[i]);
}