Advanced Searching and Sorting

Implement the two-dimensional sparse array representation outlined in Section 12.2. Include a UML class diagram of your classes.

Modify the bucketSort() method (Figure 12-20) so that the data can be distributed across any range. Take the minimum and maximum values in the array as the boundaries of the range. Your method should handle the possibility that some or all of the data are negative. How does this affect the running time of the algorithm?