Algorithms For Dummies. John Paul Mueller. Читать онлайн. Newlib. NEWLIB.NET

Автор: John Paul Mueller
Издательство: John Wiley & Sons Limited
Серия:
Жанр произведения: Программы
Год издания: 0
isbn: 9781119870005
Скачать книгу
5: Developing a Matrix Computation Class Avoiding the Use of NumPy Understanding Why Using a Class is Important Building the Basic Class Manipulating the Matrix

      6  Part 2: Understanding the Need to Sort and Search Chapter 6: Structuring Data Determining the Need for Structure Stacking and Piling Data in Order Working with Trees Representing Relations in a Graph Chapter 7: Arranging and Searching Data Sorting Data Using Merge Sort and Quick Sort Using Search Trees and the Heap Relying on Hashing

      7  Part 3: Exploring the World of Graphs Chapter 8: Understanding Graph Basics Explaining the Importance of Networks Defining How to Draw a Graph Measuring Graph Functionality Putting a Graph in Numeric Format Chapter 9: Reconnecting the Dots Traversing a Graph Efficiently Sorting the Graph Elements Reducing to a Minimum Spanning Tree Finding the Shortest Route Chapter 10: Discovering Graph Secrets Envisioning Social Networks as Graphs Navigating a Graph Chapter 11: Getting the Right Web page Finding the World in a Search Engine Explaining the PageRank Algorithm Implementing PageRank Going Beyond the PageRank Paradigm

      8  Part 4: Wrangling Big Data Chapter 12: Managing Big Data Transforming Power into Data Streaming Flows of Data Sketching an Answer from Stream Data Chapter 13: Parallelizing Operations Managing Immense Amounts of Data Working Out Algorithms for MapReduce Chapter 14: Compressing and Concealing Data Making Data Smaller Hiding Your Secrets with Cryptography

      9  Part 5: Challenging Difficult Problems Chapter 15: Working with Greedy Algorithms Deciding When It Is Better to Be Greedy Finding Out How Greedy Can Be Useful Chapter 16: Relying on Dynamic Programming Explaining Dynamic Programming Discovering the Best Dynamic Recipes Chapter 17: Using Randomized Algorithms Defining How Randomization Works Putting Randomness into your Logic Chapter 18: Performing Local Search Understanding Local Search Presenting local search tricks Solving Satisfiability of Boolean Circuits Chapter 19: Employing Linear Programming Using Linear Functions as a Tool Using Linear Programming in Practice Chapter 20: Considering Heuristics Differentiating Heuristics Routing Robots Using Heuristics Explaining Path Finding Algorithms

      10  Part 6: The Part of Tens Chapter 21: Ten Algorithms That Are Changing the World Using Sort Routines Looking for Things with Search Routines Shaking Things Up with Random Numbers Performing Data Compression Keeping Data Secret Changing the Data Domain Analyzing