• Title: Data Structures and Algorithms: Annotated Reference with Examples
• Authors Granville Barnett, Luca Del Tongo, John Bullinaria
• Publisher: Internet Archive (2014); University of Birmingham (2019)
• Paperback/Hardcover: N/A
• eBook: HTML, PDF (112 pages), ePub, Kindle, etc.
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

Every book has a story as to how it came about and this one is no different, although we would be lying if we said its development had not been somewhat impromptu. Put simply 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 (with the omission of the subtitle of course!).

The conversation started off something like, "Why don't we create a more aesthetically pleasing way to present our pseudocode?" After a few weeks this new presentation style had in fact grown into pseudocode listings with chunks of text describing how the data structure or algorithm in question works and various other things about it. At this point we thought, "What the heck, let's make this thing into a book!" And so, in the summer of 2008 we began work on this book side by side with the actual library implementation.

A key factor of this book and its associated implementations is that all algorithms (unless otherwise stated) were designed by us, using the theory of the algorithm in question as a guideline (for which we are eternally grateful to their original creators).

Therefore they may sometimes turn out to be worse than the "normal" implementations -- and sometimes not. We are two fellows of the opinion that choice is a great thing. Read our book, read several others on the same subject and use what you see fit from each (if anything) when implementing your own version of the algorithms in question.

• N/A

• Amazon

• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Computational Complexity
• Discrete Mathematics

• Data Structures and Algorithms: Annotated Reference with Examples
• The Mirror Site (1) - Read Online
• The Mirror Site (1) - PDF, ePub, etc.
• Exercises (Source Code)

• Open Data Structures: An Introduction (Pat Morin)

  This book is an introduction to the field of data structures and algorithms, it covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

• Think Data Structures: Algorithms and Information Retrieval

  This practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials. Useful in technical interviews too.

• Foundations of Computer Science - Data Structures using C

  This textbook combines the theoretical foundations of computing with essential discrete mathematics. It shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs.

• Algorithms and Data Structures: The Basic Toolbox (K. Mehlhorn)

  This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends.

• Purely Functional Data Structures (Chris Okasaki)

  This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. All source code is given in Standard ML and Haskell.

• Algorithms and Data Structures (Niklaus Wirth)

  From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

• Algorithms and Data Structures: Apps to Graphics and Geometry

  An introductory coverage of algorithms and data structures with application to graphics and geometry aims to show a sample of the intellectual demands required by a computer science curriculum, exercises, many with solutions, are included throughout the book.

• Data Structures and Algorithms Using C (Debdutta Pal, et al.)

  Refine and enhance the innovative approach to algorithms and data structures. Using a C implementation, highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.

• Notes on Data Structures and Programming Techniques in C

  There are two purposes to this book: to teach you to program in the C programming language, and to teach you how to choose, implement, and use data structures and standard programming techniques.

• Data Structures: Fundamental Tools (Wikibooks)

  This book describes data structures from the point of view of programming, with examples, and presents design techniques that allow programmers to develop their own data structures.

• Problem Solving with Algorithms and Data Structures Using Python

  This is a textbook about computer science. It is also about Python. However, there is much more. The tools and techniques that you learn here will be applied over and over as you continue your study of computer science.

• Data Structures and Algorithms in Dart (Jonathan Sande)

  This book is for programmers who are familiar with the Dart language but would like to improve the efficiency of their code and take their skills to the next level. You'll learn how to analyze the efficiency of your code and express that efficiency using Big O notation.

• Swift Algorithms and Data Structures (Wayne Bishop)

  This book blends modern code, illustrations, and computer science to help you build your next app using in the new iOS development language called Swift, provides an introduction to commonly used data structures and algorithms.

• Ruby Data Structures and Algorithms (Christopher Fox)

  This book is a concise introduction to data structures and algorithms in Ruby. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections.

• Data Structures and Algorithm Analysis in C++, 3rd Edition

  A comprehensive treatment focusing on the creation of efficient data structures and algorithms, using C++. This text explains how to select or design the data structure best suited to specific problems.

• Data Structures and Algorithm Analysis in Java, 3rd Edition

  A comprehensive treatment focusing on the creation of efficient data structures and algorithms, using Java. This text explains how to select or design the data structure best suited to specific problems.

• Java Structures: Data Structures in Java for the Programmers

  This book attempts to provide a fresh and focused approach to the design and implementation of classic structures in a manner that meshes well with existing Java packages.

• Go Data Structures and Algorithms (Christopher Fox)

  A concise introduction to data structures and algorithms in Go. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections.

• AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java

  Illustrateing how to program AI algorithms in Lisp, Prolog, and Java. Topics include: simple production-like system based on logic, logic-based learning, and natural language parsing.

• Data Structures Succinctly, Part 1 (Robert Horvick)

  This is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. It also features code samples and vivid diagrams to help you visualize the more abstract structures and algorithms.

• Data Structures Succinctly, Part 2 (Robert Horvick)

  This is your 2nd step to a better understanding of the different types of data structures, focus on lists, hash tables, heaps, priority queues, AVL trees, and B-trees. It explains what each structure's methods and classes are, the algorithms behind them, etc.

• Algorithms and Data Structures in VLSI Design

  This book presents broad and in-depth coverage of the entire field of modern VLSI Design with ordered binary decision diagrams (OBDDs), emphasizes its applications in computer aided circuit design.

• Data Structures and Algorithms with OPP Design Patterns in Python

  It promotes object-oriented design using Python and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in Java

  It promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in C++

  This book presents readers with a modern, object-oriented perspective for looking at data structures and algorithms using C++, clearly showing how to use polymorphism and inheritance, and including fragments from working and tested programs.

• Data Structures and Algorithms with OPP Design Patterns in C#

  It promotes object-oriented design using C# and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in Ruby

  It promotes object-oriented design using Ruby and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.