Radix sort is a non-comparative sorting algorithm that sorts numbers by treating them as strings of digits. There are two types: most significant digit radix sort which sorts starting from the beginning of the number string, and least significant digit radix sort which sorts starting from the end. The algorithm performs multiple passes where each pass sorts the numbers based on one digit, placing them into buckets based on their digit value. The numbers are then collected from the buckets in sorted order.

2.  It is a sorting algorithm that is used to sort numbers
and it is non comparative sorting method.
 Radix sort was developed for sorting large integers, but it
treats an integer as a string of digits, so it is really a string
sorting algorithm.
 There are two types of radix sorting:
MSD :-
Radix sort starts sorting from the beginning of strings (most
significant digit).
LSD :-
Radix sort starts sorting from the end of strings (least
significant digit)

3.  Suppose we have 3-digits number and total number
which we will sort are 5.
lets starts, we have numbers 120,234,204,101,230
We have 3-digits numbers so the number of passes will
be 3. suppose we have 5 buckets,
Pass 1: sorting 1 digit from right.
120 has 1st digit 0 put it in 0 bucket, this process repeats
as it is for remaining bucket
0 1 2 3 4
230
120
101 204
234

4. We collect all numbers from bottom up sequence from
bucket so it will be like this
120,230 ,101,234,204
Pass 2:
We will take 2nd -digit of number in Pass 2 .IN 120 “2 ” Is
2nd number put it in 2 bucket and this process is repeats as
it is in remaining buckets.
We collect numbers from bucket from bottom up sequence
so we get sorted numbers
101,204,120,230,234.
0 1 2 3 4
204
101
234
230120

5. Pass 3:
We will take 3rd digit number in Pass 3 .In 101 “1 ” Is 3rd
number put it in 1st bucket and this process is repeats as it is
in remaining buckets.
We collect numbers from bucket by bottom up sequence
0 1 2 3 4
RADIX SORT :
Sorted numbers are
101,120,204,230,234.
120
101
234
230
204