Fast Fourier Transform and using it to speed up polynomial multiplication is the topic of the two problems in this note taken from Algorithms — Extended Dance Remix: Fast Fourier Transforms.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Loop invariants is the topic of the problem in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Cool proof of the Schröder-Bernstein Theorem.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Maximum subsequence problem.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
A line of $n$ airline passengers is waiting to board a plane.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Induction and integer inequalities are the topics of this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Inclusion-exclusion principle and the number of derangements are the topics of the problem in this section.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Bipartite graphs, network flows, matchings and vertex covers are the topics of thisproblem1in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Hamming codes are used to solve the problem in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
In how many combinations of half-dollars, quarters, dimes, nickels and pennies can you pay out one dollar ?
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Coin weighings are the topics of the problem in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
We explore some variants of the Bernoulli Inequality.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Completeness and related properties are the topic of this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Countable sets and counting schemes for infinite countable sets are the topics of the problem in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Counting words with constraints is the topic of the problem in this note.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Loop invariants and a constraint relaxation are used to solve this problem.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.
Groovy Numbers.
open full screen ↗ Your browser can't display this PDF inline. Open it directly.