# Implement the radix sort algorithm described in Exercise R14.22 to sort arrays of numbers between 0 and 999. Data from

## Question:

Implement the radix sort algorithm described in Exercise R14.22 to sort arrays of numbers between 0 and 999.

**Data from Exercise R14.22**

The radix sort algorithm sorts an array of n integers with d digits, using ten auxiliary arrays. First place each value v into the auxiliary array whose index corresponds to the last digit of v. Then move all values back into the original array, preserving their order. Repeat the process, now using the next-to-last (tens) digit, then the hundreds digit, and so on. What is the big-Oh time of this algorithm in terms of n and d? When is this algorithm preferable to merge sort?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Step by Step Answer:

**Related Book For**

**Question Details**

Chapter #

**14**Section: PROGRAMMING PROJECTS

Problem: 6

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.