This notebook was prepared by Donne Martin. Source and license info is on GitHub.

Solution Notebook

Problem: Implement insertion sort.

Constraints

  • Is a naive solution sufficient?
    • Yes
  • Are duplicates allowed?
    • Yes
  • Can we assume the input is valid?
    • No
  • Can we assume this fits memory?
    • Yes

Test Cases

  • None -> Exception
  • Empty input -> []
  • One element -> [element]
  • Two or more elements

Algorithm

Wikipedia's animation: alt text

  • For each value index 1 to n - 1
    • Compare with all elements to the left of the current value to determine new insertion point
      • Hold current value in temp variable
      • Shift elements from new insertion point right
      • Insert value in temp variable
      • Break

Complexity:

  • Time: O(n^2) average, worst. O(1) best if input is already sorted
  • Space: O(1) for the iterative solution

Misc:

  • In-place
  • Stable

Insertion sort works well for very small datasets where most of the input is already sorted.

Code

In [1]:
class InsertionSort(object):

    def sort(self, data):
        if data is None:
            raise TypeError('data cannot be None')
        if len(data) < 2:
            return data
        for r in range(1, len(data)):
            for l in range(r):
                if data[r] < data[l]:
                    temp = data[r]
                    data[l+1:r+1] = data[l:r]
                    data[l] = temp
        return data

Unit Test

In [2]:
%%writefile test_insertion_sort.py
import unittest


class TestInsertionSort(unittest.TestCase):

    def test_insertion_sort(self):
        insertion_sort = InsertionSort()

        print('None input')
        self.assertRaises(TypeError, insertion_sort.sort, None)

        print('Empty input')
        self.assertEqual(insertion_sort.sort([]), [])

        print('One element')
        self.assertEqual(insertion_sort.sort([5]), [5])

        print('Two or more elements')
        data = [5, 1, 7, 2, 6, -3, 5, 7, -1]
        self.assertEqual(insertion_sort.sort(data), sorted(data))

        print('Success: test_insertion_sort')


def main():
    test = TestInsertionSort()
    test.test_insertion_sort()


if __name__ == '__main__':
    main()
Overwriting test_insertion_sort.py
In [3]:
%run -i test_insertion_sort.py
None input
Empty input
One element
Two or more elements
Success: test_insertion_sort