      "\n",
      "def merge_sort(data):\n",
      "    if len(data) < 2:\n",
      "        return data\n",
      "    mid = int(len(data) / 2)\n",
      "    left = data[0:mid]\n",
      "    right = data[mid:len(data)]\n",
      "    left = merge_sort(left)\n",
      "    right = merge_sort(right)\n",
      "    return merge(left, right)"
 
</s> remove     "    for i in range(size/2):\n",
 </s> add     "    for i in range(size//2):\n", </s> remove     "    pivot_index = int(len(data) / 2)\n",
 </s> add     "    pivot_index = len(data) // 2\n",
    "    mid = len(data) // 2\n",
      "\n",
      "def merge_sort(data):\n",
      "    if len(data) < 2:\n",
      "        return data\n",
    "    mid = len(data) // 2\n",
      "    left = data[0:mid]\n",
      "    right = data[mid:len(data)]\n",
      "    left = merge_sort(left)\n",
      "    right = merge_sort(right)\n",
      "    return merge(left, right)"
keep keep keep keep replace keep keep keep keep keep
 Fixed Python2 vs Python3 division compatibility. 
sorting_searching/merge_sort/merge_sort_solution.ipynb