Skip to content

Create radixSort.java #28

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.

Sign up for GitHub

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

Merged
dynamitechetan merged 1 commit into from
Apr 25, 2017
+67 −0
Merged

Create radixSort.java #28

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
67 changes: 67 additions & 0 deletions radixSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,67 @@

import java.io.*;
import java.util.*;

class Radix {


static 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;
}

static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n];
int i;
int count[] = new int[10];
Arrays.fill(count,0);

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

for (i = 1; i < 10; i++)
count[i] += count[i - 1];

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];
}

static void radixsort(int arr[], int n)
{

int m = getMax(arr, n);


for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}


static void print(int arr[], int n)
{
for (int i=0; i<n; i++)
System.out.print(arr[i]+" ");
}



public static void main (String[] args)
{
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
int n = arr.length;
radixsort(arr, n);
print(arr, n);
}
}
// Written by James Mc Dermott(theycallmemac)