      "    if len(data) < 2:\n",
      "        return data\n",
      "    left = []\n",
      "    right = []\n",
      "    pivot_index = int(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",
 
</s> remove     "    for i in range(size/2):\n",
 </s> add     "    for i in range(size//2):\n", </s> remove     "    mid = int(len(data) / 2)\n",
 </s> add     "    mid = len(data) // 2\n",
    "    pivot_index = len(data) // 2\n",
      "    if len(data) < 2:\n",
      "        return data\n",
      "    left = []\n",
      "    right = []\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(0, len(data)):\n",
      "        if i == pivot_index:\n",
keep keep keep keep replace keep keep keep keep keep
 Fixed Python2 vs Python3 division compatibility. 
sorting_searching/quick_sort/quick_sort_solution.ipynb