content update

1 files changed, 0 insertions, 150 deletions

diff --git a/slides/presentations/example/default.pug b/slides/presentations/example/default.pug
deleted file mode 100644
index c84446d..0000000
--- a/slides/presentations/example/default.pug
+++ /dev/null
@@ -1,150 +0,0 @@
-section
-  h1 Why understanding of basic math is imporant for computer programing
-  p September 21, 2018
-  a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan
-
-
-
-section.center
-  q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them.
-  footer — Albert Einstein
-
-
-
-section
-  h2 How we usually find solutions and why this is problematic?
-
-  ul
-    li We search for code example instead of algorithms.
-    li We copy and paste and do testing on trial&error principle.
-    li We don't take enough time to properly understand problem we a re trying to solve.
-    li Brute force solutions we make are usually not optimized
-
-
-section
-  h3 Grid example
-  div.grid.col-1-1
-    div Lipsum
-    div Lipsum
-
-  div.grid.col-2-1
-    div Lipsum
-    div Lipsum
-
-  div.grid.col-1-2
-    div Lipsum
-    div Lipsum
-
-section
-  h2 Basic linear algebra
-
-  pre
-    code.language-css
-      | body {
-      |   background: black;
-      | }
-
-  pre
-    code.language-javascript
-      | $(document).ready(function() {
-      |   $('pre code').each(function(i, block) {
-      |     hljs.highlightBlock(block);
-      |   });
-      | });
-
-  hr
-  figcaption.right Step 1: Finding nearest point
-
-  div.center
-    img(src="drawing1.svg")
-
-  hr
-  figcaption.right Step 1: Finding nearest point
-
-  $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$
-  $$ \large{ e^{i\pi} + 1 = 0 } $$
-  $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$
-
-  hr
-  figcaption.right Step 2: Finding nearest point
-
-  pre
-    code.language-python
-      | fruits = ["apple", "banana", "cherry"]
-      | for x in fruits:
-      |   if x == "banana":
-      |     break
-      |   print(x)
-
-  hr
-  figcaption.right Finding nearest point
-
-  $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$
-  $$ \large{ e^{i\pi} + 1 = 0 } $$
-  $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-c
-      | #include <stdio.h>
-      | int main () {
-      |   for( ; ; ) {
-      |       printf("This loop will run forever.\n");
-      |   }
-      |   return 0;
-      | }
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-python
-      | fruits = ["apple", "banana", "cherry"]
-      | for x in fruits:
-      |   if x == "banana":
-      |     break
-      |   print(x)
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-sql
-      | SELECT `CustomerName`, `City` FROM `Customers`;
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-go
-      | package main
-      | import "fmt"
-      | func main() {
-      |         sum := 0
-      |         for i := 0; i < 10; i++ {
-      |                 sum += i
-      |         }
-      |         fmt.Println(sum)
-      | }
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-javascript
-      | $(document).ready(function() {
-      |   $('pre code').each(function(i, block) {
-      |     hljs.highlightBlock(block);
-      |   });
-      | });
-
-  hr
-  figcaption.right Finding nearest point
-
-  pre
-    code.language-css
-      | body {
-      |   background: black;
-      | }