Files
AlgorithmNotes/Foundations/overview/insertion_sort_unittest.py
pezy_mbp c9d631140f added 2.1-1,2,3
1. added insertion-sort pseudocode and code,unittest
2. added 2.1-1 and 2.1-2
3. part of 2.1-3
2015-05-11 01:09:00 +08:00

22 lines
678 B
Python

__author__ = 'pezy'
import unittest
from insertion_sort import *
# case from @Mooophy
class InsertionSortTest(unittest.TestCase):
def test_insertion_sort(self):
self.assertEqual(insertion_sort([5, 2, 4, 6, 1, 3]), [1, 2, 3, 4, 5, 6])
self.assertEqual(insertion_sort([5]), [5])
self.assertEqual(insertion_sort([]), [])
self.assertEqual(insertion_sort([1, 5, 2, 1, 6]), [1, 1, 2, 5, 6])
def test_insertion_sort_non_increasing(self):
self.assertEqual(insertion_sort_non_increasing([1, 5, 2, 1, 6]), [6, 5, 2, 1, 1])
self.assertEqual(insertion_sort_non_increasing([]), [])
if __name__ == '__main__':
unittest.main()