In this chapter, we have discussed three different algorithm design paradigms. We've seen example problems for all of them and discussed how we can identify whether problems may be solvable by one of the given paradigms. In the next chapter, we will be focusing on some string matching algorithms that use the paradigms introduced here.

#### Beginning Java Data Structures and Algorithms

##### By :

#### Beginning Java Data Structures and Algorithms

##### By:

#### Overview of this book

Learning about data structures and algorithms gives you a better insight on how to solve common programming problems. Most of the problems faced everyday by programmers have been solved, tried, and tested. By knowing how these solutions work, you can ensure that you choose the right tool when you face these problems.
This book teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You’ll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications.

Table of Contents (8 chapters)

Preface

Free Chapter

Algorithms and Complexities

Sorting Algorithms and Fundamental Data Structures

Hash Tables and Binary Search Trees

Algorithm Design Paradigms

String Matching Algorithms

Graphs, Prime Numbers, and Complexity Classes

Other Books You May Enjoy

Customer Reviews