# Cormen Edition 3 Exercise 8.3 Question 3 (Page No. 200)

135 views
Use induction to prove that radix sort works. Where does your proof need the assumption that the intermediate sort is stable?

## Related questions

1 vote
1
224 views
Show how to sort $n$ integers in the range $0$ to $n^3-1$ in $O(n)$ time.
A probability distribution function $P(x)$ for a random variable $X$ is defined by $P(x) =Pr\{X\leq x\}$.Suppose that we draw a list of $n$ random variables $X_1,X_2,…,X_n$ from a continuous probability distribution function $P$ that is computable in $O(1)$ time. Give an algorithm that sorts these numbers in linear averagecase time.