GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-07 09:58:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix #13, PEP8-ify notebooks.

Browse Source
This commit is contained in:
Donne Martin
2015-07-11 15:35:12 -04:00
parent 04083b2011
commit 03f04fbc4c
12 changed files with 71 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
sorting_searching/merge_sort/merge_sort_challenge.ipynb
View File

@@ -34,7 +34,6 @@
"source": [
"## Constraints\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]
@@ -119,13 +118,15 @@
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" data = merge_sort(data)\n",
" assert_equal(data, sorted(data))\n",
" \n",
"\n",
" print('Success: test_merge_sort')\n",
"\n",
"\n",
"def main():\n",
" test = TestMergeSort()\n",
" test.test_merge_sort()\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]

5
sorting_searching/merge_sort/merge_sort_solution.ipynb
View File

@@ -110,6 +110,7 @@
" r += 1\n",
" return result\n",
"\n",
"\n",
"def merge_sort(data):\n",
" if len(data) < 2:\n",
" return data\n",
@@ -165,13 +166,15 @@
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" data = merge_sort(data)\n",
" assert_equal(data, sorted(data))\n",
" \n",
"\n",
" print('Success: test_merge_sort')\n",
"\n",
"\n",
"def main():\n",
" test = TestMergeSort()\n",
" test.test_merge_sort()\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]

4
sorting_searching/merge_sort/test_merge_sort.py
View File

@@ -17,12 +17,14 @@ class TestMergeSort(object):
data = [5, 1, 7, 2, 6, -3, 5, 7, -1]
data = merge_sort(data)
assert_equal(data, sorted(data))
print('Success: test_merge_sort')
def main():
test = TestMergeSort()
test.test_merge_sort()
if __name__ == '__main__':
main()