search

GDSC-MITS / Contribute-To-HacktoberFest

Link Tree for all our socials
https://linktr.ee/gdscmits
14 stars 41 forks source link

Radix Sort.c #25

Closed sonali1905 closed 1 year ago

sonali1905 commented 1 year ago

Hacktober Fest

Glitchyi commented 1 year ago

Please do give a more informational description

sonali1905 commented 1 year ago

First, we have to find the largest element (suppose max) from the given array. Suppose 'x' be the number of digits in max. The 'x' is calculated because we need to go through the significant places of all elements. After that, go through one by one each significant place. Here, we have to use any stable sorting algorithm to sort the digits of each significant place.