Data Structures, Algorithms, Java, Big O Notation, Searching And Sorting.
{ Collections.sort((bucket[i])); } // Get the sorted array int index = 0; for (int i = 0; i < n; i++) { for (int j = 0, size = bucket[i].size(); j < size; j++) { arr[index++] = bucket[i].get(j); } } } 4.10 Radix sort The complexity of time is O(nk), and the complexity of space is O(n+k). Radix sort