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

14
sorting_searching/insertion_sort/insertion_sort_challenge.ipynb
View File

@@ -34,7 +34,6 @@
"source": [
"## Constraints\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]
@@ -103,7 +102,7 @@
"\n",
"\n",
"class TestInsertionSort(object):\n",
" \n",
"\n",
" def test_insertion_sort(self):\n",
" print('Empty input')\n",
" data = []\n",
@@ -119,12 +118,17 @@
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" insertion_sort(data)\n",
" assert_equal(data, sorted(data))\n",
" \n",
"\n",
" print('Success: test_insertion_sort')\n",
"\n",
"if __name__ == '__main__':\n",
"\n",
"def main():\n",
" test = TestInsertionSort()\n",
" test.test_insertion_sort()"
" test.test_insertion_sort()\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]
},
{

14
sorting_searching/insertion_sort/insertion_sort_solution.ipynb
View File

@@ -33,7 +33,6 @@
"source": [
"## Constraints\n",
"\n",
"* Is a naiive solution sufficient?\n",
" * Yes"
]
@@ -126,7 +125,7 @@
"\n",
"\n",
"class TestInsertionSort(object):\n",
" \n",
"\n",
" def test_insertion_sort(self):\n",
" print('Empty input')\n",
" data = []\n",
@@ -142,12 +141,17 @@
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" insertion_sort(data)\n",
" assert_equal(data, sorted(data))\n",
" \n",
"\n",
" print('Success: test_insertion_sort')\n",
"\n",
"if __name__ == '__main__':\n",
"\n",
"def main():\n",
" test = TestInsertionSort()\n",
" test.test_insertion_sort()"
" test.test_insertion_sort()\n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]
},
{

13
sorting_searching/insertion_sort/test_insertion_sort.py
View File

@@ -2,7 +2,7 @@ from nose.tools import assert_equal
class TestInsertionSort(object):
def test_insertion_sort(self):
print('Empty input')
data = []
@@ -18,9 +18,14 @@ class TestInsertionSort(object):
data = [5, 1, 7, 2, 6, -3, 5, 7, -1]
insertion_sort(data)
assert_equal(data, sorted(data))
print('Success: test_insertion_sort')
if __name__ == '__main__':
def main():
test = TestInsertionSort()
test.test_insertion_sort()
test.test_insertion_sort()
if __name__ == '__main__':
main()