Karumanchi, Narasimha <br/><br/>
Data structures and algorithms made easy in Java / 
Narasimha Karumanchi 
 - Madinaguda, Hyerabad :  CareerMonk Publications,  c2014 
 - 391 pages :  illustrations ;  28 cm. 
<br/><br/>Includes bibliographical references. 
<br/><br/>1. Introduction -- 2. Recursion and backtracking -- 3. Linked lists -- 4. Stacks -- 5. Queues -- 6. Trees -- 7. Priority queue and heaps -- 8. Disjoint sets ADT -- 9. Graph algorithms -- 10. Sorting -- 11. Searching -- 12. Selection algorithms [Medians] -- 13. Symbol tables -- 14. Hashing -- 15. String algorithms -- 16. Algorithms design techniques -- 17. Greedy algorithms -- 18. Divide and conquer algorithms -- 19. Dynamic programming -- 20. Complexity classes -- 21. Miscellaneous concepts. 
<br/><br/> The main objective of the book is not to give you the theorems and proofs about data structures and algorithms. I have followed a pattern of improving the problem solutions with different complexities ( for each problem, you will find multiple solutions with different, and reduced complexities). 
<br/><br/><label>ISBN: </label>9781468101270 
<br/><br/><label>Subjects--Topical Terms: </label><br/>COMPUTER ALGORITHMS
<br/><br/><label>LC Class. No.: </label>QA 76.73.J38 .K37 2014