Ordinary Generating Functions: Difference between revisions
From charlesreid1
(Created page with "=Notes= ==Knuth== See AOCP/Generating Functions") |
(→Knuth) |
||
| Line 1: | Line 1: | ||
=Notes= | =Notes= | ||
==Knuth== | ==Knuth Art of Computer Programming== | ||
See [[AOCP/Generating Functions]] | See [[AOCP/Generating Functions]] | ||
==Trotter Chapter 8== | |||
=Flags= | |||
{{AlgorithmsFlag}} | |||
{{CombinatoricsFlag}} | |||
Revision as of 22:16, 4 August 2017
Notes
Knuth Art of Computer Programming
Trotter Chapter 8
Flags
 |
Algorithms Part of Computer Science Notes
Series on Algorithms
Algorithms/Sort · Algorithmic Analysis of Sort Functions · Divide and Conquer · Divide and Conquer/Master Theorem Three solid O(n log n) search algorithms: Merge Sort · Heap Sort · Quick Sort Algorithm Analysis/Merge Sort · Algorithm Analysis/Randomized Quick Sort
Algorithms/Search · Binary Search · Binary Search Modifications
Algorithms/Combinatorics · Algorithms/Combinatorics and Heuristics · Algorithms/Optimization · Divide and Conquer
Algorithms/Strings · Algorithm Analysis/Substring Pattern Matching
Algorithm complexity · Theta vs Big O Amortization · Amortization/Aggregate Method · Amortization/Accounting Method Algorithm Analysis/Matrix Multiplication
Estimation Estimation · Estimation/BitsAndBytes
Algorithm Practice and Writeups Project Euler · Five Letter Words · Letter Coverage
|
 |
Combinatorics
Combinatorial Structures - Order Does Not Matter Ordinary generating functions
Labelled Structures - Order Matters Enumerating Permutations: String Permutations Generating Permutations: Cool · Algorithm M (add-one) · Algorithm G (Gray binary code)
Combinatorics Problems Longest Increasing Subsequence · Maximum Value Contiguous Subsequence · Racing Gems Cards (poker hands with a deck of 52 playing cards)
|