      "\n",
      "    # Recursively apply quick_sort\n",
      "    left = quick_sort(left)\n",
      "    right = quick_sort(right)\n",
      "    return left + [pivot_value] + right"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
 
</s> remove     "    for i in range(0, len(data)):\n",
    "        if i == pivot_index:\n",
    "            continue\n",
    "        if data[i] < pivot_value:\n",
 </s> add     "    for i in range(len(data)):\n",
    "        if data[i] == pivot_value:\n",
    "            equal.append(data[i])\n",
    "        elif data[i] < pivot_value:\n", </s> remove    "version": "3.4.3"
 </s> add    "version": "3.5.0"
    "    return left + equal + right"
      "\n",
      "    # Recursively apply quick_sort\n",
      "    left = quick_sort(left)\n",
      "    right = quick_sort(right)\n",
    "    return left + equal + right"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
keep keep keep keep replace keep keep keep keep keep
 Polish quicksort challenge and solution

Update constraints and code. 
sorting_searching/quick_sort/quick_sort_solution.ipynb