By Anirudh C V

In this sorting method we apply Counting sort to given numbers digit by digit starting from least significant digit to most significant digit.

Radix Sort is a sorting technique where we sort given elements digit by digit starting from least significant digit to most significant digit. Here we have analysed Radix Sort using Counting Sort.

For example : Take an array = {12,24,25,47,6,85,90,243,100,476,900,74}

First we sort the given array with respect to ones place value.

After 1st sort we get - 90 100 900 12 243 24 74 25 85 6 476 47

We repeat the Counting Sort to each digits until all are sorted.

After 2nd sort we get - 100 900 6 12 24 25 243 47 74 476 85 90

After 3rd sort we get - 6 12 24 25 47 74 85 90 100 243 476 900

Finally we get a sorted array.

Submitted by Anirudh C V (AnirudhCV)

- College Enquiry System using Flask in Python
- ATM Project using Java-Beginner level
- Bank Application in Java
- Age Calculator using Java
- BitMasking basic operations in Java
- Authentication with Firebase in Android Studio using a Phone Number in Java
- Card Number Detailer using C++
- Basic calculator using C++

Download packets of source code on Coders Packet