This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges).
Refer to the Solution Notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start.
In [ ]:
def insertion_sort(data):
# TODO: Implement me
pass
In [ ]:
# %load test_insertion_sort.py
from nose.tools import assert_equal
class TestInsertionSort(object):
def test_insertion_sort(self):
print('Empty input')
data = []
insertion_sort(data)
assert_equal(data, [])
print('One element')
data = [5]
insertion_sort(data)
assert_equal(data, [5])
print('Two or more elements')
data = [5, 1, 7, 2, 6, -3, 5, 7, -1]
insertion_sort(data)
assert_equal(data, sorted(data))
print('Success: test_insertion_sort')
def main():
test = TestInsertionSort()
test.test_insertion_sort()
if __name__ == '__main__':
main()
Review the Solution Notebook for a discussion on algorithms and code solutions.