Algorithms: Fundamental Techniques
by Macneil Shonle, Matthew Wilson, Martin Krischik
Publisher: Wikibooks 2006
Number of pages: 68
This book aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the book, we will explain only the most basic techniques, and we will give intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
Home page url
Download or read it online for free here:
by Richard P. Brent, Paul Zimmermann - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
by Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
by Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
by Clifford A. Shaffer - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.