StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues Projects Releases Wiki Activity

Fixed Python2 vs Python3 division compatibility.

Browse Source
This commit is contained in:
Donne Martin 2015-07-06 06:44:09 -04:00
parent b57ca00bb2
commit 9df39726c1
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
sorting_searching/merge_sort/merge_sort_solution.ipynb
View File

@ -33,7 +33,6 @@
"source": [ "source": [
"## Constraints\n", "## Constraints\n",
"\n", "\n",
"* Is a naiive solution sufficient?\n", "* Is a naiive solution sufficient?\n",
" * Yes" " * Yes"
] ]
@ -87,6 +86,9 @@
}, },
"outputs": [], "outputs": [],
"source": [ "source": [
"from __future__ import division\n",
"\n",
"\n",
"def merge(left, right):\n", "def merge(left, right):\n",
" l = 0\n", " l = 0\n",
" r = 0\n", " r = 0\n",
@ -111,7 +113,7 @@
"def merge_sort(data):\n", "def merge_sort(data):\n",
" if len(data) < 2:\n", " if len(data) < 2:\n",
" return data\n", " return data\n",
" mid = len(data) / 2\n", " mid = int(len(data) / 2)\n",
" left = data[0:mid]\n", " left = data[0:mid]\n",
" right = data[mid:len(data)]\n", " right = data[mid:len(data)]\n",
" left = merge_sort(left)\n", " left = merge_sort(left)\n",