Update Project

More documentation was added to the algorithms.

Author: ansegura7

README.md

@@ -1,11 +1,11 @@
-# Algorithms Course - Python
+# Python Algorithms Course
 ![version](https://img.shields.io/badge/version-Pro-blue)
-![release](https://img.shields.io/badge/release-1.1.0-blue)
+![release](https://img.shields.io/badge/release-1.2.0-blue)
 ![language](https://img.shields.io/badge/language-Python_3.7%7C3.8-brightgreen)
-![last-update](https://img.shields.io/badge/last_update-05/17/2021-orange)
+![last-update](https://img.shields.io/badge/last_update-05/18/2021-orange)
 ![last-update](https://img.shields.io/badge/license-MIT-orange)
 
-Repository course with the implementation (in Python) and description of several computational, mathematical and statistical algorithms.
+Free hands-on course with the implementation (in Python) and description of several computational, mathematical and statistical algorithms.
 
 Although it is not intended to have the formal rigor of a book, we tried to be as faithful as possible to the original algorithms and methods, only adding variants, when these were necessary for didactic purposes.
 
@@ -104,12 +104,12 @@ In mathematics and computer science, an algorithm is a finite sequence of well-d
 - K. Rosen. (2012). *Discrete Mathematics and Its Applications*. NewYork, NY: McGraw-Hill Education; Edición: 7th.
 
 ## Contributing and Feedback
-Any kind of feedback/criticism would be greatly appreciated (algorithm design, documentation, improvement ideas, spelling mistakes, etc...).
+Any kind of feedback/suggestions would be greatly appreciated (algorithm design, documentation, improvement ideas, spelling mistakes, etc...). If you want to make a contribution to the course you can do it through a PR.
 
 ## Author
-- Created by Andrés Segura Tinoco
+- Created by Andrés Segura-Tinoco
 - Created on May 17, 2019
-- Updated on May 17, 2021
+- Updated on May 18, 2021
 
 ## License
 This project is licensed under the terms of the MIT license.

basics/AlgorithmsBasics.html

@@ -14267,7 +14267,7 @@ <h1 id="4.-Dynamic-Programming">4. Dynamic Programming<a class="anchor-link" hre
 <ul>
 <li><strong>Created by Andrés Segura Tinoco</strong></li>
 <li><strong>Created on Jan 26, 2020</strong></li>
-<li><strong>Updated on Mar 19, 2021</strong></li>
+<li><strong>Updated on May 18, 2021</strong></li>
 </ul>
 
 </div>
@@ -14336,7 +14336,7 @@ <h2 id="4.1.-Binomial-Coefficient">4.1. Binomial Coefficient<a class="anchor-lin
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="Formula-approach">Formula approach<a class="anchor-link" href="#Formula-approach">&#182;</a></h4>
+<h3 id="4.1.1.-Formula-approach">4.1.1. Formula approach<a class="anchor-link" href="#4.1.1.-Formula-approach">&#182;</a></h3>
 </div>
 </div><div class="jp-Cell jp-CodeCell jp-Notebook-cell jp-mod-noOutputs  ">
 <div class="jp-Cell-inputWrapper">
@@ -14383,7 +14383,7 @@ <h4 id="Formula-approach">Formula approach<a class="anchor-link" href="#Formula-
 
 <div class="jp-RenderedText jp-OutputArea-output" data-mime-type="text/plain">
 <pre>3268760
-&gt;&gt; elapsed time 1.0612999999999317 ms
+&gt;&gt; elapsed time 0.3633999999999027 ms
 </pre>
 </div>
 </div>
@@ -14395,7 +14395,7 @@ <h4 id="Formula-approach">Formula approach<a class="anchor-link" href="#Formula-
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-approach">&#182;</a></h4>
+<h3 id="4.1.2.-Simple-approach">4.1.2. Simple approach<a class="anchor-link" href="#4.1.2.-Simple-approach">&#182;</a></h3>
 </div>
 </div><div class="jp-Cell jp-CodeCell jp-Notebook-cell jp-mod-noOutputs  ">
 <div class="jp-Cell-inputWrapper">
@@ -14444,7 +14444,7 @@ <h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-app
 
 <div class="jp-RenderedText jp-OutputArea-output" data-mime-type="text/plain">
 <pre>3268760
-&gt;&gt; elapsed time 1490.9646999999998 ms
+&gt;&gt; elapsed time 1602.7969 ms
 </pre>
 </div>
 </div>
@@ -14456,7 +14456,7 @@ <h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-app
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="Dynamic-Programming">Dynamic Programming<a class="anchor-link" href="#Dynamic-Programming">&#182;</a></h4>
+<h3 id="4.1.3.-Dynamic-Programming">4.1.3. Dynamic Programming<a class="anchor-link" href="#4.1.3.-Dynamic-Programming">&#182;</a></h3>
 </div>
 </div><div class="jp-Cell jp-CodeCell jp-Notebook-cell jp-mod-noOutputs  ">
 <div class="jp-Cell-inputWrapper">
@@ -14511,7 +14511,7 @@ <h4 id="Dynamic-Programming">Dynamic Programming<a class="anchor-link" href="#Dy
 
 <div class="jp-RenderedText jp-OutputArea-output" data-mime-type="text/plain">
 <pre>3268760
-&gt;&gt; elapsed time 1.1279000000001815 ms
+&gt;&gt; elapsed time 1.0575999999997698 ms
 </pre>
 </div>
 </div>
@@ -14551,7 +14551,7 @@ <h2 id="4.2.-World-Championship-problem">4.2. World Championship problem<a class
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-approach">&#182;</a></h4>
+<h3 id="4.2.1.-Simple-approach">4.2.1. Simple approach<a class="anchor-link" href="#4.2.1.-Simple-approach">&#182;</a></h3>
 </div>
 </div><div class="jp-Cell jp-CodeCell jp-Notebook-cell jp-mod-noOutputs  ">
 <div class="jp-Cell-inputWrapper">
@@ -14602,7 +14602,7 @@ <h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-app
 
 <div class="jp-RenderedText jp-OutputArea-output" data-mime-type="text/plain">
 <pre>0.6710359124216079
-&gt;&gt; elapsed time 96.77349999999984 ms
+&gt;&gt; elapsed time 152.84509999999952 ms
 </pre>
 </div>
 </div>
@@ -14614,7 +14614,7 @@ <h4 id="Simple-approach">Simple approach<a class="anchor-link" href="#Simple-app
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="Dynamic-Programming">Dynamic Programming<a class="anchor-link" href="#Dynamic-Programming">&#182;</a></h4>
+<h3 id="4.2.2.-Dynamic-Programming">4.2.2. Dynamic Programming<a class="anchor-link" href="#4.2.2.-Dynamic-Programming">&#182;</a></h3>
 </div>
 </div><div class="jp-Cell jp-CodeCell jp-Notebook-cell jp-mod-noOutputs  ">
 <div class="jp-Cell-inputWrapper">
@@ -14674,7 +14674,7 @@ <h4 id="Dynamic-Programming">Dynamic Programming<a class="anchor-link" href="#Dy
 
 <div class="jp-RenderedText jp-OutputArea-output" data-mime-type="text/plain">
 <pre>0.6710359124216079
-&gt;&gt; elapsed time 0.9304999999999453 ms
+&gt;&gt; elapsed time 3.256300000000323 ms
 </pre>
 </div>
 </div>
@@ -15550,7 +15550,7 @@ <h2 id="4.6.-Sequence-Alignment-problem">4.6. Sequence Alignment problem<a class
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">
 </div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput " data-mime-type="text/markdown">
-<h4 id="The-Needleman-Wunsch-algorithm-will-be-used">The Needleman-Wunsch algorithm will be used<a class="anchor-link" href="#The-Needleman-Wunsch-algorithm-will-be-used">&#182;</a></h4>
+<h3 id="4.6.1.-The-Needleman-Wunsch-algorithm-will-be-used">4.6.1. The Needleman-Wunsch algorithm will be used<a class="anchor-link" href="#4.6.1.-The-Needleman-Wunsch-algorithm-will-be-used">&#182;</a></h3>
 </div>
 </div>
 <div class="jp-Cell-inputWrapper"><div class="jp-InputPrompt jp-InputArea-prompt">

basics/AlgorithmsBasics.ipynb

@@ -13,7 +13,7 @@
    "source": [
     "- **Created by Andrés Segura Tinoco**\n",
     "- **Created on Jan 26, 2020**\n",
-    "- **Updated on Mar 19, 2021**"
+    "- **Updated on May 18, 2021**"
    ]
   },
   {
@@ -81,7 +81,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### Formula approach"
+    "### 4.1.1. Formula approach"
    ]
   },
   {
@@ -105,7 +105,7 @@
      "output_type": "stream",
      "text": [
       "3268760\n",
-      ">> elapsed time 1.0612999999999317 ms\n"
+      ">> elapsed time 0.3633999999999027 ms\n"
      ]
     }
    ],
@@ -119,7 +119,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### Simple approach"
+    "### 4.1.2. Simple approach"
    ]
   },
   {
@@ -145,7 +145,7 @@
      "output_type": "stream",
      "text": [
       "3268760\n",
-      ">> elapsed time 1490.9646999999998 ms\n"
+      ">> elapsed time 1602.7969 ms\n"
      ]
     }
    ],
@@ -159,7 +159,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### Dynamic Programming"
+    "### 4.1.3. Dynamic Programming"
    ]
   },
   {
@@ -191,7 +191,7 @@
      "output_type": "stream",
      "text": [
       "3268760\n",
-      ">> elapsed time 1.1279000000001815 ms\n"
+      ">> elapsed time 1.0575999999997698 ms\n"
      ]
     }
    ],
@@ -231,7 +231,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### Simple approach"
+    "### 4.2.1. Simple approach"
    ]
   },
   {
@@ -259,7 +259,7 @@
      "output_type": "stream",
      "text": [
       "0.6710359124216079\n",
-      ">> elapsed time 96.77349999999984 ms\n"
+      ">> elapsed time 152.84509999999952 ms\n"
      ]
     }
    ],
@@ -273,7 +273,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### Dynamic Programming"
+    "### 4.2.2. Dynamic Programming"
    ]
   },
   {
@@ -310,7 +310,7 @@
      "output_type": "stream",
      "text": [
       "0.6710359124216079\n",
-      ">> elapsed time 0.9304999999999453 ms\n"
+      ">> elapsed time 3.256300000000323 ms\n"
      ]
     }
    ],
@@ -1115,7 +1115,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "#### The Needleman-Wunsch algorithm will be used"
+    "### 4.6.1. The Needleman-Wunsch algorithm will be used"
    ]
   },
   {