From: Neil Smith <neil.git@njae.me.uk>
Date: Sun, 22 Jun 2014 22:32:00 +0000 (+0100)
Subject: Added fast-cheap-good picture, tidyied some formatting
X-Git-Url: https://git.njae.me.uk/?p=cipher-training.git;a=commitdiff_plain;h=f24be00acb639c41c0b1ec6899c4bbee74a653ef

Added fast-cheap-good picture, tidyied some formatting
---

diff --git a/slides/affine-break.html b/slides/affine-break.html
index cca64e8..58b27f6 100644
--- 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 1a09109..30f3900 100644
--- 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
index 0000000..63411f0
Binary files /dev/null and b/slides/fast-good-cheap.gif differ