Added fast-cheap-good picture, tidyied some formatting

diff --git a/slides/affine-break.html b/slides/affine-break.html
index cca64e86cd51a8a3caff61b2a3a95caa9b9dc1e6..58b27f6fb3bf780c92e4204cb7822336d9aee014 100644 (file)
--- a/slides/affine-break.html
+++ b/slides/affine-break.html
@@ -51,7 +51,7 @@ a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t |
 --|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|--
 b | e | h | k | n | q | t | w | z | c | f | i | l | o | r | u | x | a | d | g | j | m | p | s | v | y
 
-----
+---
 
 # Duplicate and extend your `caesar_break()` function
 

diff --git a/slides/affine-encipher.html b/slides/affine-encipher.html
index 1a09109d9920a0f07cf70174300d05d61aaadaf8..30f3900f7525cb694ce2fdbcb79df60d40b7f9e5 100644 (file)
--- a/slides/affine-encipher.html
+++ b/slides/affine-encipher.html
@@ -101,7 +101,7 @@ World's oldest algorithm.
 
 _a_ = _qb_ + _r_ ; gcd(_a_, _b_) = gcd(_qb_ + _r_, _b_) = gcd(_r_, _b_) = gcd(_b_, _r_)
 
-Repeatedly apply these steps until _r_ = 0, when the other number = gcd(a,b). For instance, _a_ = 81, _b_ = 57
+Repeatedly apply these steps until _r_ = 0, when the other number = gcd(_a_, _b_). For instance, _a_ = 81, _b_ = 57
 
 * 81 = 1 × 57 + 24
 * 57 = 2 × 24 + 9
@@ -130,6 +130,8 @@ Can we do this in one pass?
 
 # Triple constraints
 
+.float-right[![right-aligned GCD](fast-good-cheap.gif)]
+
 ## Fast, cheap, good: pick two
 
 ## Programmer time, execution time, space: pick one, get some of another.

diff --git a/slides/fast-good-cheap.gif b/slides/fast-good-cheap.gif
new file mode 100644 (file)
index 0000000..63411f0
Binary files /dev/null and b/slides/fast-good-cheap.gif differ