## Monday, 23 January 2017

### Chapter 23 Exercise 12, Introduction to Java Programming, Tenth Edition Y. Daniel LiangY.

22.12 (Radix sort) Write a program that randomly generates 1,000,000 integers and sorts them using radix sort.

import java.util.ArrayList;
public class Exercise12 {

public static void main(String[] args) {
int maxOrder = 1000000;
int[] list = new int[1000000];
for (int i = 0; i < list.length; i++) {
list[i] = (int) (Math.random() * maxOrder);
}
long time = System.currentTimeMillis();
System.out.println("Time = " + (System.currentTimeMillis() - time));
}

static void radixSort(int[] list, int maxOrder) {
for (int order = 1; order < maxOrder; order *= 10) {
@SuppressWarnings("unchecked")
ArrayList<Integer>[] bucket = new ArrayList[10];

for (int i = 0; i < bucket.length; i++) {
bucket[i] = new java.util.ArrayList<>();
}

for (int i = 0; i < list.length; i++) {
}

int k = 0;
for (int i = 0; i < bucket.length; i++) {
if (bucket[i] != null) {
for (int j = 0; j < bucket[i].size(); j++)
list[k++] = bucket[i].get(j);
}
}
}
}
}