Next: Problem 5 - Operating
Up: Information Science I
Previous: Problem 3 - Lambda
Answer the following problems that sort signed 32-bit numbers.
- 1.
- Show an algorithm based on quick sort.
- 2.
- Show an algorithm based on radix sort.
- 3.
- Compare sorting speed of above two algorithms for sorting randomly generated data whose length is
sufficiently long. (At least show a coefficient of the principal term.)
See [SED00] for a detailed answer.
Reynald AFFELDT
2000-06-08