It is a slide of the algorithm of radix sort. It is quite easy to understand.

1. RADIX SORT

2. PRIMARY INSTRUCTIONS
• Take n Numbers
• Find the biggest number from them
• Execute a loop including the function of radix
sort for k number of times where ,
k= Number of digits of the biggest number

3. Example
• We take ten numbers
• Biggest number is of three digits.
• So, the loop shall run for three times for each
of digit’s place

4. 432 8 530 90 88 231 11 45 677 199

5. ONE’S PLACE
LOOP 1

6. 0 1 2 3 4 5 6 7 8 9
0 0 0 0 0 0 0 0 0 0
432 8 530 90 88 231 11 45 677 199
We Increase the count[n]’s value for every digit n at
one’s place

7. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 0 0 0 0 0 0 0 0 0

8. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 0 1 0 0 0 0 0 0 0

9. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 0 1 0 0 0 0 0 1 0

10. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
1 0 1 0 0 0 0 0 1 0

11. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 0 1 0 0 0 0 0 1 0

12. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 0 1 0 0 0 0 0 2 0

13. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 1 1 0 0 0 0 0 2 0

14. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 1 0 0 0 0 0 2 0

15. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 1 0 0 1 0 0 2 0

16. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 1 0 0 1 0 1 2 1

17. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 1 0 0 1 0 1 2 1
WE ADD THE COUNTS CUMULATIVELY

18. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 1 0 0 1 0 1 2 1
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 6 6 7 9 10
COUNT
CUMULATIVE COUNT

19. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 6 6 7 9 10
COUNT

20. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 6 6 7 9 10
COUNT
OUTPUT 1

21. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 6 6 7 9 9
COUNT
199
OUTPUT 1
-1

22. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 6 6 6 9 9
COUNT
677 199
OUTPUT 1
-1

23. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 4 5 5 5 5 6 6 9 9
COUNT
45 677 199
OUTPUT 1
-1

24. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 3 5 5 5 5 6 6 9 9
11 45 677 199
OUTPUT 1
-1

25. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
2 2 5 5 5 5 6 6 9 9
231 11 45 677 199
OUTPUT 1
-1

26. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
1 2 5 5 5 5 6 6 8 9
90 231 11 45 677 88 199
OUTPUT 1
-1

27. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 2 5 5 5 5 6 6 8 9
530 90 231 11 45 677 88 199
OUTPUT 1
-1

28. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 2 5 5 5 5 6 6 7 9
530 90 231 11 45 677 8 88 199
OUTPUT 1
-1

29. 432 8 530 90 88 231 11 45 677 199
0 1 2 3 4 5 6 7 8 9
0 2 4 5 5 5 6 6 7 9
530 90 231 11 432 45 677 8 88 199
OUTPUT 1
-1

30. 530 90 231 11 432 45 677 8 88 199
Array sorted according to one’s place digits

31. Ten’s Place
Loop 2

32. 530 90 231 11 432 45 677 8 88 199
0 1 2 3 4 5 6 7 8 9
0 0 0 0 0 0 0 0 0 0
COUNT

33. 530 90 231 11 432 45 677 08 88 199
0 1 2 3 4 5 6 7 8 9
0 1 0 3 1 0 0 1 1 2
0 1 2 3 4 5 6 7 8 9
1 2 2 5 6 6 6 7 8 10
CUMULATIVE COUNT

34. 530 90 231 11 432 45 677 08 88 199
0 1 2 3 4 5 6 7 8 9
1 2 2 5 6 6 6 7 8 10

35. 530 90 231 11 432 45 677 08 88 199
0 1 2 3 4 5 6 7 8 9
1 1 2 2 6 5 6 6 7 8
8 11 530 231 432 45 677 88 90 199

36. 8 11 530 231 432 45 677 88 90 199
Array sorted according to ten’s place and one’s place

37. HUNDRED’S PLACE
LOOP 3

38. 8 11 530 231 432 45 677 88 90 199
0 1 2 3 4 5 6 7 8 9
5 1 1 0 1 1 1 0 0 0
0 1 2 3 4 5 6 7 8 9
5 6 7 7 8 9 10 10 10 10

39. 8 11 530 231 432 45 677 88 90 199
0 1 2 3 4 5 6 7 8 9
0 5 6 7 7 8 9 10 10 10
8 11 45 88 90 199 231 432 530 677

40. 8 11 45 88 90 199 231 432 530 677
ARRAY SORTED WITH RADIX SORT
432 8 530 90 88 231 11 45 677 199
INITIAL ARRAY

41. THE END
THANK YOU