added recursive function

Author: Jason-M-Richards

.ipynb_checkpoints/Python Toolkit-checkpoint.ipynb

@@ -32,7 +32,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Checking for PEP-8 errors\n",
+    "#### Checking for PEP-8 errors\n",
     "\n",
     "    import pycodestyle\n",
     "\n",
@@ -84,7 +84,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Help function\n",
+    "#### Help function\n",
     "\n",
     "Using before just about anything in the parentheses will bring up useful information on that call\n",
     "\n",
@@ -481,6 +481,39 @@
     "- return (data)"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "#### Recursive Functions\n",
+    "Recursion is a way of programming or coding a problem, in which a function calls itself one or more times in its body. Usually, it is returning the return value of this function call. If a function definition fulfills the condition of recursion, we call this function a recursive function.\n",
+    "\n",
+    "Termination condition:\n",
+    "A recursive function has to terminate to be used in a program. A recursive function terminates, if with every recursive call the solution of the problem is downsized and moves towards a base case. A base case is a case, where the problem can be solved without further recursion. A recursion can lead to an infinite loop, if the base case is not met in the calls.\n",
+    "\n",
+    "##### Fibonacci Sequence\n",
+    "    def fib(n):\n",
+    "        if n < 1:\n",
+    "            return \"N must be an integer greater then 1\" #will notify that positive integer is needed\n",
+    "        elif n in [1,2]:\n",
+    "                return 1 #since addition of first two elements differs from the rest, need the elif statement\n",
+    "        else:\n",
+    "            return fib(n-1) + fib(n-2) #recursive part that takes the number provided, and returns the proper calculation\n",
+    "    \n",
+    "    for i in range(1, 10):\n",
+    "        print(fib(i))\n",
+    "        \n",
+    "##### Flatten a  List \n",
+    "    def flat_list(L, result=[]):\n",
+    "        print('Current L:', L) #Optional, to display process\n",
+    "        for i in L:\n",
+    "            if type(i) == list:\n",
+    "                flat_list(i, result)\n",
+    "            else:\n",
+    "                result.append(i)\n",
+    "        return result"
+   ]
+  },
   {
    "cell_type": "markdown",
    "metadata": {},
@@ -542,7 +575,7 @@
    "source": [
     "#### Regular Expressions\n",
     "- import re - Import the Regular Expressions module\n",
-    "- re.search(r\"abc\",string) - Returns a match object if the regex \"abc\" is found in s, otherwise None\n",
+    "- re.search(r\"abc\",string) - Returns a match object if the regex \"abc\" is found in string, otherwise None\n",
     "- re.match(r\"abc\",string) - same as search, but is specific\n",
     "- re.split(r'dilimiter',string) - splits string by delimiter provided\n",
     "- re.sub(r\"abc\",\"xyz\",string) - Returns a string where all instances matching regex \"abc\" are replaced by \"xyz\"\n",
@@ -581,7 +614,7 @@
     "            notmatch_tag = re.match(r\"<(\\w+)>\", string)\n",
     "            #Print the first group capture\n",
     "            print(\"Close your {} tag!\".format(notmatch_tag.group(1)))\n",
-    "##### lookaround\n",
+    "#####  lookaround\n",
     "- regex(?=reference) = lookup word before the reference\n",
     "- regex(?!reference) = avoid looking up the word before reference\n",
     "- (?<=reference)regex = lookup word after the reference\n",
@@ -705,7 +738,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.4"
+   "version": "3.7.5"
   },
   "toc": {
    "base_numbering": 1,

Python Toolkit.ipynb

@@ -32,7 +32,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Checking for PEP-8 errors\n",
+    "#### Checking for PEP-8 errors\n",
     "\n",
     "    import pycodestyle\n",
     "\n",
@@ -84,7 +84,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Help function\n",
+    "#### Help function\n",
     "\n",
     "Using before just about anything in the parentheses will bring up useful information on that call\n",
     "\n",
@@ -481,6 +481,39 @@
     "- return (data)"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "#### Recursive Functions\n",
+    "Recursion is a way of programming or coding a problem, in which a function calls itself one or more times in its body. Usually, it is returning the return value of this function call. If a function definition fulfills the condition of recursion, we call this function a recursive function.\n",
+    "\n",
+    "Termination condition:\n",
+    "A recursive function has to terminate to be used in a program. A recursive function terminates, if with every recursive call the solution of the problem is downsized and moves towards a base case. A base case is a case, where the problem can be solved without further recursion. A recursion can lead to an infinite loop, if the base case is not met in the calls.\n",
+    "\n",
+    "##### Fibonacci Sequence\n",
+    "    def fib(n):\n",
+    "        if n < 1:\n",
+    "            return \"N must be an integer greater then 1\" #will notify that positive integer is needed\n",
+    "        elif n in [1,2]:\n",
+    "                return 1 #since addition of first two elements differs from the rest, need the elif statement\n",
+    "        else:\n",
+    "            return fib(n-1) + fib(n-2) #recursive part that takes the number provided, and returns the proper calculation\n",
+    "    \n",
+    "    for i in range(1, 10):\n",
+    "        print(fib(i))\n",
+    "        \n",
+    "##### Flatten a  List \n",
+    "    def flat_list(L, result=[]):\n",
+    "        print('Current L:', L) #Optional, to display process\n",
+    "        for i in L:\n",
+    "            if type(i) == list:\n",
+    "                flat_list(i, result)\n",
+    "            else:\n",
+    "                result.append(i)\n",
+    "        return result"
+   ]
+  },
   {
    "cell_type": "markdown",
    "metadata": {},
@@ -705,7 +738,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.4"
+   "version": "3.7.5"
   },
   "toc": {
    "base_numbering": 1,