Art of Algorithm Design
portes grátis
Art of Algorithm Design
Satpathy, Suneeta; Tripathy, Pabitra Kumar; Mohanty, Sachi Nandan
Taylor & Francis Ltd
10/2024
298
Mole
9780367555269
Pré-lançamento - envio 15 a 20 dias após a sua edição
Descrição não disponível.
Chapter 1. Fundamental Concepts of Data Structure. Chapter 2. Concepts of Algorithms and Recurrences. Chapter 3. Divide-and-Conquer Techniques. Chapter 4. Dynamic Programming. Chapter 5. Greedy Algorithms. Chapter 6. Graph. Chapter 7. Approximation Algorithms. Chapter 8. Matrix Operations, Linear Programming, Polynomial and FFT. Chapter 9. Number Theoretic Algorithms. Chapter 10. Programming Implementations of the Algorithms
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Knapsack Problem;data structures;Quick Sort;Programming;Merge Sort;Computing;Disjoint Set Data Structure;Heapsort;Bellman Ford Algorithm;Link List;Prims Algorithm;Optimal Substructure;Additive Inverse;MST;Hamiltonian Cycle;LP Relaxation;Recursion Tree;Void Display;Boolean Matrix Multiplication;Priority Queue;Traveling Salesman Problem;Preorder Traversal;Extended Euclidean Algorithm;Max Heap;Adjacency List;Elementary Row Operations;Floyd Warshall Algorithm;Greedy Algorithm
Chapter 1. Fundamental Concepts of Data Structure. Chapter 2. Concepts of Algorithms and Recurrences. Chapter 3. Divide-and-Conquer Techniques. Chapter 4. Dynamic Programming. Chapter 5. Greedy Algorithms. Chapter 6. Graph. Chapter 7. Approximation Algorithms. Chapter 8. Matrix Operations, Linear Programming, Polynomial and FFT. Chapter 9. Number Theoretic Algorithms. Chapter 10. Programming Implementations of the Algorithms
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Knapsack Problem;data structures;Quick Sort;Programming;Merge Sort;Computing;Disjoint Set Data Structure;Heapsort;Bellman Ford Algorithm;Link List;Prims Algorithm;Optimal Substructure;Additive Inverse;MST;Hamiltonian Cycle;LP Relaxation;Recursion Tree;Void Display;Boolean Matrix Multiplication;Priority Queue;Traveling Salesman Problem;Preorder Traversal;Extended Euclidean Algorithm;Max Heap;Adjacency List;Elementary Row Operations;Floyd Warshall Algorithm;Greedy Algorithm
