更新排序单元测试

Author: EINDEX

.gitignore

@@ -203,4 +203,5 @@ ENV/
 .idea
 
 .vscode
-.pytest_cache
+.pytest_cache
+.env

Pipfile

@@ -9,6 +9,7 @@ format = "columns"
 pylint = "*"
 "autopep8" = "*"
 pytest = "*"
+jedi = "*"
 
 [requires]
 python_version = "3.6"

Pipfile.lock

@@ -1,2 +1,11 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
+
+from algorithm.sort.bubble_sort import bubble_sort,  bubble_sort_flag
+from algorithm.sort.count_sort import count_sort
+from algorithm.sort.heap_sort import heap_sort
+from algorithm.sort.insert_sort import insert_sort
+from algorithm.sort.marge_sort import merge_sort
+from algorithm.sort.quick_sort import quick_sort, quick_sort_cookbook
+from algorithm.sort.selection_sort import selection_sort
+from algorithm.sort.shell_sort import shell_sort

algorithm/search/test_search.py

@@ -0,0 +1,50 @@
+import random
+from algorithm.sort import *
+
+class TestSort:
+    def gene_list(self):
+        for i in range(11):
+            yield [random.randint(0, 2**i) for _ in range(2**i)]
+
+    def sort_t(self, sort_func):
+        g = self.gene_list()
+        res = []
+        for l in g:
+            lt = l[:]
+            lt.sort()
+            res.append(lt == sort_func(l))
+        
+        return all(res)
+    
+    def test_bubble_sort(self):
+        assert self.sort_t(bubble_sort)
+
+    def test_bubble_sort_flag(self):
+        assert self.sort_t(bubble_sort_flag)
+
+    def test_count_sort(self):
+        assert self.sort_t(count_sort)
+
+    def test_shell_sort(self):
+        assert self.sort_t(shell_sort)
+
+    def test_seletion_sort(self):
+        assert self.sort_t(selection_sort)
+
+    def test_marge_sort(self):
+        assert self.sort_t(merge_sort)
+
+    def test_quick_sort(self):
+        assert self.sort_t(quick_sort)
+
+    
+    def test_quick_sort_cookbook(self):
+        assert self.sort_t(quick_sort_cookbook)
+
+    def test_insert_sort(self):
+        assert self.sort_t(insert_sort)
+    
+
+    def test_heap_sort(self):
+        assert self.sort_t(heap_sort)
+    

algorithm/sort/__init__.py

@@ -78,9 +78,48 @@ def postorder_traversal_while(self):
 
         return res[::-1]
 
+    def preorder_traversal_recursion(self):
+        """
+        树的前序遍历
+        :return: list of tree node value
+        """
+        res = []
+        if not self.root:
+            return res
+
+        def _inner(root):
+            inner_res = []
+            if root.value:
+                inner_res.append(root.value)
+                for sub_node in root.children:
+                    inner_res += _inner(sub_node)
+            return inner_res
+        return _inner(self.root)
+
+    def postorder_traversal_recursion(self):
+        """
+        树的后序遍历
+        :return: list of tree node value
+        """
+        res = []
+        if not self.root:
+            return res
+
+        def _inner(root):
+            inner_res = []
+            if root.value:
+                for sub_node in root.children:
+                    inner_res += _inner(sub_node)
+                inner_res.append(root.value)
+            return inner_res
+
+        return _inner(self.root)
+
 
 if __name__ == '__main__':
     t = Tree(
         TreeNode(1, [TreeNode(2, [TreeNode(4), TreeNode(5), TreeNode(6)]), TreeNode(3, [TreeNode(7), TreeNode(8)])]))
     print(t.preorder_traversal_while())
     print(t.postorder_traversal_while())
+    print(t.preorder_traversal_recursion())
+    print(t.postorder_traversal_recursion())