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 Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
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 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.
by Albert Nijenhuis, Herbert S. Wilf - Academic Press Inc
This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.