# sorting

For a long time it puzzled me how something so expensive, so leading edge, could be so useless. And then it occurred to me that a computer is a stupid machine with the ability to do incredibly smart things, while computer programmers are smart people with the ability to do incredibly stupid things. They are, in short, a perfect match. Bill Bryson

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 9:48 am

### Algorithm Problem Description

Least Significant Digit (LSD) radix sort process the integer representations starting from the least digit and moves towards the most significant digit. Radix sort is a linear sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.

LSD radix sorts process the integer representations starting from the least digit and moves towards the most significant digit. LSD radix sort is a stable sort. If there are multiple elements to sort with the same key, they'll end up in the same relative order in the sorted output when you run LSD radix sort. The biggest advantage of LSD radix sort is speed because it is a branch-free algorithm.

Write a program to implement LSD radix sort

### Output

```

List of items from array before sorting: [34, 56, 23, 88, 67, 89]
List of items from array after sorting: [23, 34, 56, 67, 88, 89]

```