    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "## Clarifying Questions\n",
      "\n",
      "* Is a naiive quicksort (ie not in-place) ok?\n",
      "    * Yes"
     ]
    },
 
</s> remove     "* Is a naiive quicksort (ie not in-place) ok?\n",
 </s> add     "*Problem statements are often intentionally ambiguous.  Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
    "\n",
    "* Are you looking for a naiive solution (ie not in-place)?\n", </s> remove     "## Pythonic-Code\n",
 </s> add     "## Unit Test\n", </s> remove     "From http://stackoverflow.com/questions/18262306/quick-sort-with-python"
 </s> add     "*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.*"
    "## Constraints and Assumptions\n",
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
    "## Constraints and Assumptions\n",
      "\n",
      "* Is a naiive quicksort (ie not in-place) ok?\n",
      "    * Yes"
     ]
    },
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