     "metadata": {},
     "source": [
      "## Pythonic-Code\n",
      "\n",
      "From http://stackoverflow.com/questions/18262306/quick-sort-with-python"
     ]
    },
    {
     "cell_type": "code",
     "execution_count": null,
 
</s> remove     "## Pythonic-Code\n",
 </s> add     "## Unit Test\n", </s> remove    "execution_count": null,
 </s> add    "execution_count": 3, </s> remove    "execution_count": null,
 </s> add    "execution_count": 2, </s> remove    "execution_count": null,
 </s> add    "execution_count": 1,
    "*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand.  You generally will not be asked to write a unit test like what is shown below.*"
     "metadata": {},
     "source": [
      "## Pythonic-Code\n",
      "\n",
    "*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand.  You generally will not be asked to write a unit test like what is shown below.*"
     ]
    },
    {
     "cell_type": "code",
     "execution_count": null,
keep keep keep keep replace keep keep keep keep keep
 Reworked notebook: Added more detail to constraints and test cases.  Reworked code and unit test. 
sorting-searching/quick-sort.ipynb