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

#273: Remove nose dependency for sorting_searching/ (#278)

Browse Source
This commit is contained in:
Donne Martin
2020-07-11 11:25:26 -04:00
committed by GitHub
parent abf7524c26
commit d488e4f355
30 changed files with 257 additions and 333 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
sorting_searching/insertion_sort/insertion_sort_challenge.ipynb
View File

@@ -75,9 +75,7 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class InsertionSort(object):\n",
@@ -101,32 +99,30 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_insertion_sort.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"import unittest\n",
"\n",
"\n",
"class TestInsertionSort(object):\n",
"class TestInsertionSort(unittest.TestCase):\n",
"\n",
" def test_insertion_sort(self):\n",
" insertion_sort = InsertionSort()\n",
"\n",
" print('None input')\n",
" assert_raises(TypeError, insertion_sort.sort, None)\n",
" self.assertRaises(TypeError, insertion_sort.sort, None)\n",
"\n",
" print('Empty input')\n",
" assert_equal(insertion_sort.sort([]), [])\n",
" self.assertEqual(insertion_sort.sort([]), [])\n",
"\n",
" print('One element')\n",
" assert_equal(insertion_sort.sort([5]), [5])\n",
" self.assertEqual(insertion_sort.sort([5]), [5])\n",
"\n",
" print('Two or more elements')\n",
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" assert_equal(insertion_sort.sort(data), sorted(data))\n",
" self.assertEqual(insertion_sort.sort(data), sorted(data))\n",
"\n",
" print('Success: test_insertion_sort')\n",
"\n",
@@ -166,9 +162,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

28
sorting_searching/insertion_sort/insertion_sort_solution.ipynb
View File

@@ -93,9 +93,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class InsertionSort(object):\n",
@@ -125,9 +123,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -139,26 +135,26 @@
],
"source": [
"%%writefile test_insertion_sort.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"import unittest\n",
"\n",
"\n",
"class TestInsertionSort(object):\n",
"class TestInsertionSort(unittest.TestCase):\n",
"\n",
" def test_insertion_sort(self):\n",
" insertion_sort = InsertionSort()\n",
"\n",
" print('None input')\n",
" assert_raises(TypeError, insertion_sort.sort, None)\n",
" self.assertRaises(TypeError, insertion_sort.sort, None)\n",
"\n",
" print('Empty input')\n",
" assert_equal(insertion_sort.sort([]), [])\n",
" self.assertEqual(insertion_sort.sort([]), [])\n",
"\n",
" print('One element')\n",
" assert_equal(insertion_sort.sort([5]), [5])\n",
" self.assertEqual(insertion_sort.sort([5]), [5])\n",
"\n",
" print('Two or more elements')\n",
" data = [5, 1, 7, 2, 6, -3, 5, 7, -1]\n",
" assert_equal(insertion_sort.sort(data), sorted(data))\n",
" self.assertEqual(insertion_sort.sort(data), sorted(data))\n",
"\n",
" print('Success: test_insertion_sort')\n",
"\n",
@@ -175,9 +171,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -212,9 +206,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

14
sorting_searching/insertion_sort/test_insertion_sort.py
View File

@@ -1,23 +1,23 @@
from nose.tools import assert_equal, assert_raises
import unittest
class TestInsertionSort(object):
class TestInsertionSort(unittest.TestCase):
def test_insertion_sort(self):
insertion_sort = InsertionSort()
print('None input')
assert_raises(TypeError, insertion_sort.sort, None)
self.assertRaises(TypeError, insertion_sort.sort, None)
print('Empty input')
assert_equal(insertion_sort.sort([]), [])
self.assertEqual(insertion_sort.sort([]), [])
print('One element')
assert_equal(insertion_sort.sort([5]), [5])
self.assertEqual(insertion_sort.sort([5]), [5])
print('Two or more elements')
data = [5, 1, 7, 2, 6, -3, 5, 7, -1]
assert_equal(insertion_sort.sort(data), sorted(data))
self.assertEqual(insertion_sort.sort(data), sorted(data))
print('Success: test_insertion_sort')
@@ -28,4 +28,4 @@ def main():
if __name__ == '__main__':
main()
main()