Advanced Searching and Sorting

Projects

12.31

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

12.32

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?


Part I: Object-Oriented Programming

Encapsulation

Polymorphism

Inheritance

Part II: Linear Structures

Stacks and Queues

Array-Based Structures

Linked Structures

Part III: Algorithms

Analysis of Algorithms

Searching and Sorting

Recursion

Part IV: Trees and Sets

Trees

Sets

Part V: Advanced Topics

Advanced Linear Structures

Strings

Advanced Trees

Graphs

Memory Management

Out to the Disk

Part VI: Appendices

A. Review of Java

B. Unified Modeling Language

C. Summation Formulae

D. Further Reading

Index



Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
ISBN: 0131469142
EAN: 2147483647
Year: 2004
Pages: 216
Authors: Peter Drake

Similar book on Amazon

Flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net