Design and analysis of algorithms offer exhaustive coverage of the design and analysis of algorithms and data structures. Integrating application with theory, the book presents algorithmic topics in a context that is motivated by applications to uses in society, computer games, the computing industry, Science, engineering, and the Internet. Beginning with the basic framework and tools needed to analyze algorithms, the book then presents fundamental data structures, such as stacks, queues, lists, and Advanced data structures such as trees, search trees, priority queues, heaps, hash tables, union-find structures, and graphs. This second edition incorporates the object-oriented design paradigm, using Java as the implementation language, while also providing intuition and analysis of fundamental data algorithms. It uses pictures and simplified mathematical analyses to justify important analytic concepts.