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

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