Book description
A friendly and accessible introduction to the most useful algorithms
Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview.
Reveals methods for manipulating common data structures such as arrays, linked lists, trees, and networks
Addresses advanced data structures such as heaps, 2-3 trees, B-trees
Addresses general problem-solving techniques such as branch and bound, divide and conquer, recursion, backtracking, heuristics, and more
Reviews sorting and searching, network algorithms, and numerical algorithms
Includes general problem-solving techniques such as brute force and exhaustive search, divide and conquer, backtracking, recursion, branch and bound, and more
In addition, Essential Algorithms features a companion website that includes full instructor materials to support training or higher ed adoptions.
Table of contents
- Cover Page
- Title Page
- Copyright
- About the Author
- Credits
- Acknowledgments
- Contents at a Glance
- Contents
- Introduction
- CHAPTER 1: Algorithm Basics
- CHAPTER 2: Numerical Algorithms
- CHAPTER 3: Linked Lists
- CHAPTER 4: Arrays
- CHAPTER 5: Stacks and Queues
- CHAPTER 6: Sorting
- CHAPTER 7: Searching
- CHAPTER 8: Hash Tables
- CHAPTER 9: Recursion
- CHAPTER 10: Trees
- CHAPTER 11: Balanced Trees
- CHAPTER 12: Decision Trees
- CHAPTER 13: Basic Network Algorithms
- CHAPTER 14: More Network Algorithms
- CHAPTER 15: String Algorithms
- CHAPTER 16: Cryptography
- CHAPTER 17: Complexity Theory
- CHAPTER 18: Distributed Algorithms
- CHAPTER 19: Interview Puzzles
-
APPENDIX A: Summary of Algorithmic Concepts
- Chapter 1 : Algorithm Basics
- Chapter 2 : Numeric Algorithms
- Chapter 3 : Linked Lists
- Chapter 4 : Arrays
- Chapter 5 : Stacks and Queues
- Chapter 6 : Sorting
- Chapter 7 : Searching
- Chapter 8 : Hash Tables
- Chapter 9 : Recursion
- Chapter 10 : Trees
- Chapter 11 : Balanced Trees
- Chapter 12 : Decision Trees
- Chapter 13 : Basic Network Algorithms
- Chapter 14 : More Network Algorithms
- Chapter 15 : String Algorithms
- Chapter 16 : Cryptography
- Chapter 17 : Complexity Theory
- Chapter 18 : Distributed Algorithms
- Chapter 19 : Interview Puzzles
-
APPENDIX B: Solutions to Exercises
- Chapter 1 : Algorithm Basics
- Chapter 2 : Numerical Algorithms
- Chapter 3 : Linked Lists
- Chapter 4 : Arrays
- Chapter 5 : Stacks and Queues
- Chapter 6 : Sorting
- Chapter 7 : Searching
- Chapter 8 : Hash Tables
- Chapter 9 : Recursion
- Chapter 10 : Trees
- Chapter 11 : Balanced Trees
- Chapter 12 : Decision Trees
- Chapter 13 : Basic Network Algorithms
- Chapter 14 : More Network Algorithms
- Chapter 15 : String Algorithms
- Chapter 16 : Encryption
- Chapter 17 : Complexity Theory
- Chapter 18 : Distributed Algorithms
- Chapter 19 : Interview Puzzles
- Glossary
- Index
Product information
- Title: Essential Algorithms: A Practical Approach to Computer Algorithms
- Author(s):
- Release date: August 2013
- Publisher(s): Wiley
- ISBN: 9781118612101
You might also like
book
Essential Algorithms, 2nd Edition
A friendly introduction to the most useful algorithms written in simple, intuitive English The revised and …
book
Algorithms in C++ Part 5: Graph Algorithms, Third Edition
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this …
book
Beginning Algorithms
Examples link provided by the publisher.Errata link provided by the publisher. Beginning Algorithms A good understanding …
book
Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More
Learn approaches of computational thinking and the art of designing algorithms. Most of the algorithms you …