Notes on Data Structures and Programming Techniques
by James Aspnes
Publisher: Yale University 2015
Number of pages: 530
Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.
Home page url
Download or read it online for free here:
by Luc Devroye - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
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.
by Catherine Leung - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
by Sean Luke
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.