Michael T. Goodrich, Roberto Tamassia <br/><br/>
Design and Analysis of Algorithms  
Michael T. Goodrich, Roberto Tamassia 
 - NewDelhi  Wiley  2021 
 - 602p; 
<br/><br/> Algorithm Analysis<br/>Basic Data Structures<br/>Binary Search Trees<br/>Balanced Binary Search Trees<br/>Priority Queues and Heaps<br/>Hash Tables<br/>Union Find Sructures<br/>Graphs and Traversals<br/>Sorting Algorithm<br/>Fast Sorting and Selection<br/>Divide and Conquer<br/>The Greedy Method<br/>Dynamic Programming<br/>Minimum Spanning Trees<br/>NP-Completeness<br/>Appropximation Algorithms<br/>Text Processing<br/>Number Theory Cryptography and Fast Fourier Transform<br/> 
<br/><br/> Design and Analysis of Algorithms offers an 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 from applications to uses in society, computer games, 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 
<br/><br/><label>ISBN: </label>9789354248481 
<br/><br/><label>Dewey Class. No.: </label>511.8  / GOO