aboutsummaryrefslogtreecommitdiff
path: root/slides/presentations/basic-math-in-programming/default.pug
diff options
context:
space:
mode:
Diffstat (limited to 'slides/presentations/basic-math-in-programming/default.pug')
-rw-r--r--slides/presentations/basic-math-in-programming/default.pug13
1 files changed, 12 insertions, 1 deletions
diff --git a/slides/presentations/basic-math-in-programming/default.pug b/slides/presentations/basic-math-in-programming/default.pug
index 954e083..41792ee 100644
--- a/slides/presentations/basic-math-in-programming/default.pug
+++ b/slides/presentations/basic-math-in-programming/default.pug
@@ -3,7 +3,13 @@ section
3 p September 21, 2018, rev2 3 p September 21, 2018, rev2
4 a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan 4 a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan
5 5
6 6section
7 h2 Agenda
8 ol
9 li Levenshtein distance
10 li Shortest path algorithm
11 li Distance Formula
12 li
7 13
8section.center 14section.center
9 q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them. 15 q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them.
@@ -32,6 +38,11 @@ section
32 38
33 hr 39 hr
34 40
41 div.center
42 img(src="test.png")
43
44 hr
45
35 pre 46 pre
36 code.language-python 47 code.language-python
37 | def levenshtein(seq1, seq2): 48 | def levenshtein(seq1, seq2):