add space and time complexity

pROGRAMMERDATASCIENCE22 · Feb 18, 2020 · b00f559 · b00f559
1 parent 5ba0421
commit b00f559
Show file tree

Hide file tree

Showing 2 changed files with 13 additions and 5 deletions.
diff --git a/graphs/single_cycle_check.ipynb b/graphs/single_cycle_check.ipynb
@@ -17,11 +17,11 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 4,
+   "execution_count": 10,
    "metadata": {},
    "outputs": [],
    "source": [
-    "# solution\n",
+    "# solution: O(n) time | O(1) space\n",
     "def has_single_cycle(array):\n",
     "    elements_visited = 0\n",
     "    current_index = 0\n",
@@ -46,7 +46,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 9,
+   "execution_count": 11,
    "metadata": {},
    "outputs": [
     {
@@ -55,7 +55,7 @@
        "True"
       ]
      },
-     "execution_count": 9,
+     "execution_count": 11,
      "metadata": {},
      "output_type": "execute_result"
     }
@@ -64,6 +64,14 @@
     "has_single_cycle([2, -1, 1, -2])"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "The time complexity is O(n) since we have a single while loop that iterates through the entire array of length n,\n",
+    "while the space complexity is O(1) constant time, since we are not storing any auxilliary array, just a couple of variables. "
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,

diff --git a/greatest_common_divisor.ipynb → recursion/greatest_common_divisor.ipynb b/greatest_common_divisor.ipynb → recursion/greatest_common_divisor.ipynb
@@ -161,7 +161,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.6.5"
+   "version": "3.7.4"
   }
  },
  "nbformat": 4,