# Efficient Integer Sorting with Radix Sort Algorithm

Added on  2023-04-26

7 Pages1276 Words100 Views
|
|
|
Running head: RADIX SORT ALGORITHM
RADIX SORT ALGORTIHM
Name of the Student
Name of the Organisation
Author Note
1RADIX SORT ALGORITHM
Radix Sort Algorithm is considered to be one of the sorting algorithms in which a set
of integers are sorted depending upon the digits of each individual numbers (Hamada et al.
2014). It is a non-comparable sorting algorithm of integers which is responsible for sorting
the data with keys specially integers by mainly arranging and making a group of them by
each individual digits sharing a common notable position and value. The sorting is done
considering the least significant digit at the first and then continuing to progress towards the
most significant digit. Radix sort algorithm mainly needs a definite number of passes. Now
these passes are nothing but the number of digits which are present in the greatest number
among a set of numbers. Suppose the greatest number comprises of maximum 4digits then
that set is sorted with 4 passes (Cho et al. 2015). It is to be remembered that Radix Sort
represents several strings of characters and also represents floating point numbers which are
uniquely formatted. The main aim of the study is to provide detailed study on Radix Sort
algorithm highlighting its pseudo code, processing and reasoning about where and how to use
it.
Pseudo Code of Radix Sort
Radix-Sort (B, p)
// It works similar to the counting sort for p number of passes.
//Each key in B [1....n] is a p-digit integer.
//(Numbered digits 1 to p from right to the left.)
for j = 1 to p do
//B[ ]—Initial Array for sorting
int Count[10] = {0};
//The count of keys are stored in Count[ ]
//key – number at digit place
for i = 0 to n do
2RADIX SORT ALGORITHM
Count[key of (B[i] in pass j]++
for k = 1to 10 do
Count[k] = Count[k]+Count[k-1]
//The resulting array is built by checking the position which is new of B[i] from
Count[k]
for i = n-1 down to 0 do
R[ count[key of (B[i])] ] = B[j]
Count[key of (B[i])]—
//The main array B[ ] contains sorted arrays according to the present place of
the digit
for i = 0 to n do
B[i] = R[i]
end for(j)
end func

## End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents

### Support

#### +1 306 205-2269

Chat with our experts. we are online and ready to help.

©2024 | Zucol Services PVT LTD | All rights reserved.