Think Data Structures
by Allen B. Downey
Publisher: Green Tea Press 2016
Number of pages: 187
This book is intended for college students in computer science and related fields. I try to alleviate the boredom by organizing the topics around an application -- web search -- that uses data structures extensively, and is an interesting and important topic in its own right. This book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercise that allows readers to apply what they have learned.
Home page url
Download or read it online for free here:
by Donald E. Knuth - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
by Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
by Macneil Shonle, Matthew Wilson, Martin Krischik - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.