Letussupposethatwewanttosortintegerkeysofbitseach.Radix
sortstartsbydividingthebitsintodigitsof
i
consecutivebitswhere
Pm 1
i=0
i=.Foreachdigitstartingfromtheleastsignicantone,themethod
performsthreesteps.First,usingthevaluesofdigit,themethodbuildsa
histogramofthekeyson2
bi
counters.Then,partialsumsofthecountersare
madeinsuchawaythattheycanbeusedasindicestostorethekeysinto
2
bi
bucketsinanauxiliarydestinationvector.Finally,thekeysaremovedto
thecorrespondingbucketsinthedestinationvectorwiththehelpoftheindices
createdpreviously.Thissequentialalgorithmisdescribedin[Knu73].
Thereareacoupleofremarksthatcanbemadeaboutthenatureofthe
sequentialversionofRadixSort