stacks

Author: rasbt

README.md

@@ -27,6 +27,8 @@ If you have any suggestions or want to make additions, I would be very happy if
 
 - Singly Linked List [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/data-structures/singly-linked-list.ipynb)]
 
+- Stacks [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/data-structures/stacks.ipynb)]
+
 ### Statistical Analysis
 
 - Linear regression via the least squares fit method [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/statistics/linregr_least_squares_fit.ipynb)]
@@ -57,4 +59,4 @@ If you have any suggestions or want to make additions, I would be very happy if
 
 - Finding the Maximum Pairwise Product [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/efficiency/maximum-pairwise-product.ipynb)]
 - Fibonacci Numbers [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/efficiency/fibonacci-tree.ipynb)]
-- Greatest Common Divisor [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/efficiency/greatest-common-divisor.ipynb)]
+- Greatest Common Divisor [[ IPython nbviewer ](http://nbviewer.ipython.org/github/rasbt/algorithms_in_ipython_notebooks/blob/master/ipython_nbs/efficiency/greatest-common-divisor.ipynb)]

ipython_nbs/sorting/sorting_algorithms.ipynb

@@ -42,8 +42,9 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "- [Selection sort](Selection-sort)\n",
-    "- [Bubble sort](#Bubble-sort)"
+    "- [Selection Sort](#Selection-Sort)\n",
+    "- [Merge Sort](#Merge-Sort)\n",
+    "- [Bubble Sort](#Bubble-Sort)"
    ]
   },
   {
@@ -133,7 +134,14 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "# Bubble sort"
+    "# Merge Sort"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# Bubble Sort"
    ]
   },
   {
@@ -269,7 +277,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": null,
+   "execution_count": 7,
    "metadata": {
     "collapsed": false
    },
@@ -296,11 +304,21 @@
   },
   {
    "cell_type": "code",
-   "execution_count": null,
+   "execution_count": 8,
    "metadata": {
     "collapsed": false
    },
-   "outputs": [],
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "1 loop, best of 3: 19.5 s per loop\n",
+      "The slowest run took 7804.31 times longer than the fastest. This could mean that an intermediate result is being cached.\n",
+      "1 loop, best of 3: 2.45 ms per loop\n"
+     ]
+    }
+   ],
    "source": [
     "# larger list\n",
     "\n",