• Title Algorithms and Data Structures
• Author(s) Niklaus Wirth
• Publisher: Prentice Hall (November 1985); eBook (last update 2017-10-19)
• Hardcover 288 pages
• eBook PDF (212 pages, 2.3 MB)
• Language: English and Russian
• ISBN-10: 0130220051
• ISBN-13: 978-0130220059
• Share This:  

Book Description

From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). The original book uses Modula-2 and includes new material on sequential structure, searching and priority search trees. The 2012 edition uses Oberon as the programming language.

• Niklaus Wirth is a Swiss computer scientist, best known for designing several programming languages, including Pascal, and for pioneering several classic topics in software engineering. In 1984 he won the Turing Award, generally recognized as the highest distinction in computer science,[2][3] for developing a sequence of innovative computer languages.

• Amazon
• Amazon (Algorithms, 4th Edition)

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

• Algorithms and Data Structures (Niklaus Wirth)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF
• The Mirror Site (4) - PDF

• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne

  It surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the book. We motivate each algorithm that we address by examining its impact on specific applications.

• 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.

• Data Structures and Algorithms: Reference with Examples

  A key factor of this book and its associated implementations is that all algorithms were designed by authors, using the theory of the algorithm in question as a guideline. It covers the key ideas involved in designing algorithms.

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• 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.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Problems on Algorithms, 2nd Edition (Ian Parberry)

  This book provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.

• 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.

• Clever Algorithms: Nature-Inspired Programming Recipes

  The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization, etc.

• Planning Algorithms (Steven M. LaValle)

  This is the only book for teaching and referencing of Planning Algorithms in applications including robotics, computational biology, computer graphics, manufacturing, aerospace applications and medicine, etc.

• Parallel Algorithms (Henri Casanova, et al)

  Focusing on algorithms for distributed-memory parallel architectures, the book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

• Numerical Algorithms: Computer Vision, Machine Learning, etc.

  This book presents a new approach to numerical analysis for modern computer scientists, covers a wide range of topics - from numerical linear algebra to optimization and differential equations - focusing on real-world motivation and unifying themes.