Mindmap
Algorithms and Data Structures
Inhalt der Mindmap
Algorithms and Data Structures
0. Prologue
- Enter Fibonacci
- Big-O Notation
1. Algorithms with numbers
- Basic Arithmetic
- Modular arithmetic
- Primality testing
- Cryptography
2. Divide and conquer
- Multiplication
- Recurrence relations
- Mergesort
- Medians
- Matrix multiplication
3. Decomposition of graphs
- Depth-first search in undirected graphs
- Depth-first search in undirected graphs
- Strongly connected components
4. Paths in graphs
- Breadth-fist search
- Dikstra's algorithm
5. Greedy algorithms
- Huffman encoding
- Horn formulas
- Set cover
Dynamic programming
- Longest increasing subsequences
7. Linear programming and reductions
- Postscript: circuit evaluation
8. NP-complete problems
Informationen
- Beschreibung
- Mindmap am Algorithms and Data Structures, erstellt von Hasan Gökçe am 16/12/2017.
- Erstellt von
- Hasan Gökçe
- Aufrufe
- 1
- Bewertung