Data Structures and Algorithms
Annotated Reference with Examples


Book Details
Authors | Granville Barnett, Luca Del Tongo |
Published | 2008 |
Edition | 1 |
Paperback | 111 pages |
Language | English |
License | Open Access |
Book Description
This book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most imperative programming languages. It is not a definitive book on the theory of data structures and algorithms.
For the most part this book presents implementations devised by the authors themselves based on the concepts by which the respective algorithms are based upon so it is more than possible that our implementations differ from those considered the norm.
You should use this book alongside another on the same subject, but one that contains formal proofs of the algorithms in question. In this book we use the abstract big Oh notation to depict the run time complexity of algorithms so that the book appeals to a larger audience.
Data Structures and Algorithms (DSA) features implementations of data structures and algorithms that are not implemented in any version of .NET. This book is the result of a series of emails sent back and forth between the two authors during the development of a library for the .NET framework of the same name. A key factor of this book and its associated implementations is that all algorithms were designed by us, using the theory of the algorithm in question as a guideline. The book use's pseudo code to describe the solutions that we have created so that it can be easily ported to many imperative OO languages like C#, C++, and Java (amongst others).
This book is published as open-access, which means it is freely available to read, download, and share without restrictions.
If you enjoyed the book and would like to support the author, you can purchase a printed copy (hardcover or paperback) from official retailers.