Beginning Java Data Structures and Algorithms
| Learn |
|
|---|---|
| About |
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. |
| Features |
|
| Page Count | 202 |
| Course Length | 6 hours 3 minutes |
| ISBN | 9781789537178 |
| Date Of Publication | 29 Jul 2018 |
| Developing Our First Algorithm |
| Measuring Algorithmic Complexity with Big O Notation |
| Identifying Algorithms with Different Complexities |
| Summary |
| Introducing Bubble Sorting |
| Understanding Quick Sort |
| Using Merge Sort |
| Getting Started with Fundamental Data Structures |
| Summary |
| Introducing Hash Tables |
| Getting Started with Binary Search Trees |
| Summary |
| Introducing Greedy Algorithms |
| Getting Started with Divide and Conquer Algorithms |
| Understanding Dynamic Programming |
| Summary |
| Naive Search Algorithm |
| Getting Started with the Boyer-Moore String Searching Algorithm |
| Introducing Other String Matching Algorithms |
| Summary |
| Representing Graphs |
| Traversing a Graph |
| Calculating Shortest Paths |
| Prime Numbers in Algorithms |
| Other Concepts in Graphs |
| Understanding Complexity Classes of Problems |
| Summary |