User:Dicewitch/Python Algorithms Study Guide
From Wikipedia, the free encyclopedia
Dropzone
[edit ]2. The Basics
[edit ]Foundational Concepts
[edit ]Summary
[edit ]If you're curious...
[edit ]3. Counting 101
[edit ]Summary
[edit ]If you're curious...
[edit ]- Combinatorics
- Concrete Mathematics by Graham, Knuth and Patashnik
- Generating function
- annihilator
- Akra–Bazzi method
4. Induction and Recursion
[edit ]- Mathematical induction
- Recursion (computer science)
- Reduction (complexity)
- Topological sorting
- Relaxation (approximation)
If You're Curious
[edit ]5. Traversal
[edit ]- Eulerian path
- Hamiltonian path
- Seven Bridges of Königsberg
- Depth-first search
- Breadth-first search
- Graph traversal
- Maze solving algorithm
- Kosaraju's algorithm
6. Divide, Combine, and Conquer
[edit ]If you're curious...
[edit ]- Bisection (software engineering)
- Bloom filter
- Red–black tree
- AVL tree
- Splay tree
- Treap
- Skip list
- Spatial database
- Interval tree
- Quadtree
- Octree