From da71121f0f6aabbac30f961c77916ba0e982ac7f Mon Sep 17 00:00:00 2001
From: Mitja Felicijan <mitja.felicijan@gmail.com>
Date: Mon, 24 Sep 2018 01:38:12 +0200
Subject: content update

---
 slides/presentations/basic-math-in-programming/default.pug | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

(limited to 'slides/presentations/basic-math-in-programming/default.pug')

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
   p September 21, 2018, rev2
   a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan
 
-
+section
+  h2 Agenda
+  ol
+    li Levenshtein distance
+    li Shortest path algorithm
+    li Distance Formula
+    li
 
 section.center
   q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them.
@@ -32,6 +38,11 @@ section
 
   hr
 
+  div.center
+    img(src="test.png")
+
+  hr
+
   pre
     code.language-python
       | def levenshtein(seq1, seq2):
-- 
cgit v1.2.3