Radix Sort Algorithm - The Coding Shala

Last Updated: 27-Jan-2021
Home >> Algorithms >> Radix Sort Algorithm

 In this post, we will learn what is Radix Sort Algorithm and how to implement Radix Sort in Java.

Radix Sort Algorithm

As we know sorting algorithms like Merge sort, Quicksort, etc is works in O(N log N) time. They can not do better than NlogN. We have another option as Counting sort that works in a linear time O(n+k) but the limitation in the range is there.

We use the Radix sort algorithm when we have elements in the range from 1 to n^2. In the Radix sort algorithm, we do digit by digit sort starting from least significant digit(leftmost) to most significant digit(rightmost). We use counting sort to sort the digits because the range of these digits is less in the range of 0 to 9.

Working of Radix Sort Algorithm

Radix sort works by sorting the input numbers one digit at a time. let's take an example:

input array->  { 127,  324, 173,  4,  38,  217,  134}

First, we will sort the array based on the one's place. We will use the counting sort algorithm since the digits can only take on a small number of values from 0 to 9(in decimals) or 0-1(in binary format).

Here is what the array looks like after the one's place sorting:

   after sorting-> { 173,  324,  4,  134,  127,  217,  38 }

Another reason for using counting sort here is counting sort algorithm is comes in a stable sorting algorithm. A stable sorting algorithm is if two values are the same in the array then they come in the same order after sorting the array.

Now, we will sort the array on the ten's place:

array->            { 173,  324,  04,  134,  127,  217,  38 }
after sorting-> { 04,  217,  324,  127,  134,  38,  173 }

And finally we will sort on the hundred's place:

array->     { 004,  217,  324,  127,  134,  038,  173 }
after sorting->  { 004,  038,  127,  134,  173,  217,  324 }

and we are done. Our final sorted array looks like this:
{ 4, 38, 127, 134, 173, 217, 324}

Before we start our Radix sort we will find the max number in the array to we'll know the max numbers of digits.

Time Complexity of Radix Sort Algorithm

The Radix sort algorithm takes O( d*(n+k)) time and O(n+k) space. Here n is the number of the items to sort, k is the number of values each digit can have and d is the number of digits in each item.

In Radix sort, we use counting sort that takes O(n+k) time and space and we do it for every digit of the item so Radix sort takes O(d*(n+k)) time.

So we can say that the radix sort algorithm works on O(n) time.

Radix Sort Algorithm Java Program

Here is how we code it in Java.

Java Program: 

//counting sort
//the coding shala

class Main{
	
	public static void counting_sort(int[] input, int exp) {
		int len = input.length;
		//range is 0 to 9(inclusive)
		int[] output = new int[len];
		int[] counts = new int[10];
		
		//step 1 count the numbers of element
		for(int i=0;i<len;i++) {
			int last_digit = (input[i]/exp)%10;
			counts[last_digit]++;
		}
		
		//modify the count array to get index to sort the array
		for(int i=1; i<counts.length; i++) {
			counts[i] += counts[i-1];
		}
		
		//now take the index from counts array 
		//insert at index in output array
		//decrease the value by 1 in counts array
		// To make it stable we are operating in reverse order.
		for(int i=len-1; i>=0; i--) {
			int ele = input[i];
			int last_digit = (ele/exp)%10;
			int index = counts[last_digit];
			output[index-1] = ele;
			counts[last_digit]--;
		}
		
		//insert back to original array
		for(int i=0; i<len;i++) {
			input[i] = output[i];
		}
	}
	
	public static void radix_sort(int[] input) {
		//first find out the max number
		int max = input[0];
		for(int i=1; i<input.length; i++) {
			if(input[i]>max) max = input[i];
		}
		
		//now we will sort array based on each digits
		for(int exp = 1; max/exp > 0; exp = exp*10) {
			counting_sort(input, exp);
		}
	}
	
	
	public static void main(String[] args) {
		int[] input = { 127,  324, 173,  4,  38,  217,  134};
		int len = input.length;
		radix_sort(input);
		for(int i=0;i<len;i++) {
			System.out.print(input[i]+" ");
		}
	}
}


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y
Read more

Add two numbers in Scala - The Coding Shala

Home >> Learn Scala >> Add Two Numbers  In this post, we will learn how to write a Scala program to Add Two Numbers. Add Two Numbers in Scala The following is the Scala program to Add two Numbers. Scala Program:  //add two numbers in scala //the coding shala object Main { def main ( args : Array [ String ]){ //we can take user input also val num1 = 10 ; val num2 = 20 ; //add both numbers val result = num1 + num2 ; println ( "Sum of " + num1 + " + " + num2 + " = " + result ); } } Other Posts You May Like Scala - Hello World Program Java - Hello World Program Power of Two Simple XML Validator Fibonacci Series Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
Read more

New Year Chaos Solution - The Coding Shala

Home >> Programming Questions >> New Year Chaos New Year Chaos Problem Solution In this post, you will learn how to solve New Year Chaos Problem and implement its solution in Java. Problem:   It's New Year's Day and everyone's in line for the Wonderland rollercoaster ride! There are a number of people queued up, and each person wears a sticker indicating their initial position in the queue. Initial positions increment from at the front of the line to at the back.  Any person in the queue can bribe the person directly in front of them to swap positions. If two people swap positions, they still wear the same sticker denoting their original places in line. One person can bribe at most two others.  For Example, if n=8 and Person 5 bribes Person 4, the queue will look like this: 1,2,3,5,4,6,7,8. Fascinated by this chaotic queue, you decide you must know the minimum number of bribes that took place to get the queue into its current state. Input:
Read more

Richest Customer Wealth LeetCode Solution - The Coding Shala

Home >> LeetCode >> Richest Customer Wealth  In this post, we will learn how to solve LeetCode's Richest Customer Wealth problem and will implement its solution in Java. Richest Customer Wealth Problem You are given an m x n integer grid accounts where accounts[i][j] is the amount of money i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.  A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth. Example 1: Input: accounts = [[1,2,3],[3,2,1]] Output: 6 Explanation: 1st customer has wealth = 1 + 2 + 3 = 6 2nd customer has wealth = 3 + 2 + 1 = 6 Both customers are considered the richest with a wealth of 6 each, so return 6. Example 2: Input: accounts = [[1,5],[7,3],[3,5]] Output: 10 Example 3: Input: accounts = [[2,8,7],[7,1,3],[1,9,5]] Output: 17 Practice this problem on LeetCode . LeetCode - Richest Customer
Read more