diff options
| author | Mitja Felicijan <mitja.felicijan@gmail.com> | 2018-09-25 11:49:54 +0200 |
|---|---|---|
| committer | Mitja Felicijan <mitja.felicijan@gmail.com> | 2018-09-25 11:49:54 +0200 |
| commit | fbf414a0407e492371c736c895257b2072962934 (patch) | |
| tree | a76909643460b2dad6e12b30726ed39df1e7559d /slides | |
| parent | 8a2c66f03ce427fcd6796dda1095d5746d7ad791 (diff) | |
| download | mitjafelicijan.com-fbf414a0407e492371c736c895257b2072962934.tar.gz | |
content update
Diffstat (limited to 'slides')
| -rw-r--r-- | slides/presentations/basic-math-in-programming/default.pug | 5 |
1 files changed, 0 insertions, 5 deletions
diff --git a/slides/presentations/basic-math-in-programming/default.pug b/slides/presentations/basic-math-in-programming/default.pug index 41792ee..7ca262b 100644 --- a/slides/presentations/basic-math-in-programming/default.pug +++ b/slides/presentations/basic-math-in-programming/default.pug | |||
| @@ -15,8 +15,6 @@ section.center | |||
| 15 | 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. |
| 16 | footer — Albert Einstein | 16 | footer — Albert Einstein |
| 17 | 17 | ||
| 18 | |||
| 19 | |||
| 20 | section | 18 | section |
| 21 | h2 How we usually find solutions and why this is problematic? | 19 | h2 How we usually find solutions and why this is problematic? |
| 22 | 20 | ||
| @@ -26,7 +24,6 @@ section | |||
| 26 | li We don't take enough time to properly understand problem we a re trying to solve. | 24 | li We don't take enough time to properly understand problem we a re trying to solve. |
| 27 | li Brute force solutions we make are usually not optimized | 25 | li Brute force solutions we make are usually not optimized |
| 28 | 26 | ||
| 29 | |||
| 30 | section | 27 | section |
| 31 | h2 Levenshtein distance | 28 | h2 Levenshtein distance |
| 32 | p The Levenshtein distance is a string metric for measuring difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. | 29 | p The Levenshtein distance is a string metric for measuring difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. |
| @@ -194,8 +191,6 @@ section | |||
| 194 | | background: black; | 191 | | background: black; |
| 195 | | } | 192 | | } |
| 196 | 193 | ||
| 197 | |||
| 198 | |||
| 199 | section | 194 | section |
| 200 | h3 Grid example | 195 | h3 Grid example |
| 201 | div.grid.col-1-1 | 196 | div.grid.col-1-1 |