add datastructure

Author: EINDEX

Diff for: Search/binary_search.py

@@ -0,0 +1,32 @@
+def binary_search_while(arr, key):
+    """迭代版"""
+    arr.sort()
+    l_index, h_index = 0, len(arr) - 1
+    while l_index <= h_index:
+        mid = h_index - (h_index - l_index) // 2
+        if key < arr[mid]:
+            h_index = mid - 1
+        elif key > arr[mid]:
+            l_index = mid + 1
+        else:
+            return arr[mid]
+    else:
+        return
+
+
+def binary_search_re(arr, key):
+    """递归版"""
+    arr.sort()
+
+    def binary_search_re_do(l_index, h_index):
+        if l_index >= h_index:
+            return arr[l_index]
+        mid = h_index - (h_index - l_index) // 2
+        if key < arr[mid]:
+            return binary_search_re_do(l_index, mid - 1)
+        elif key > arr[mid]:
+            return binary_search_re_do(mid + 1, h_index)
+        else:
+            return arr[mid]
+
+    return binary_search_re_do(0, len(arr) - 1)

Diff for: Search/hash_search.py

@@ -1,6 +1,6 @@
 def linear_search(arr, key):
     """顺序(线性)查找算法实现"""
-    for index, value in enumerate(arr):
+    for value in arr:
         # 寻找目标
-        if value == key:
-            return index
+        while value == key:
+            return value

Diff for: Search/linear_search.py

@@ -0,0 +1,51 @@
+from unittest import TestCase
+
+
+def get_random_arr(max_num, length):
+    import random
+    return [random.uniform(0, max_num) for x in range(length)]
+
+
+def create_arr_list():
+    """测试序列"""
+    arr_list = [[0], [0, 1]]
+    for x in range(6):
+        arr = get_random_arr(10 ** x, 10 ** x)
+        arr_list.append(arr)
+    return arr_list
+
+
+def search_log(func):
+    import time, random
+    arr_list = create_arr_list()
+
+    def wrapper(*args, **kw):
+        start = time.time()
+        for arr in arr_list:
+            key = random.choice(arr)
+            func(arr=arr, key=key, *args, **kw)
+        over = time.time()
+        print(func.__name__ + ' time: %f' % (over - start))
+        return
+
+    return wrapper
+
+
+class TestSearch(TestCase):
+    @search_log
+    def test_linear_search(self, arr, key):
+        from Search.linear_search import linear_search
+        if not key == linear_search(arr, key):
+            self.fail()
+
+    @search_log
+    def test_binary_search_while(self, arr, key):
+        from Search.binary_search import binary_search_while
+        if not key == binary_search_while(arr, key):
+            self.fail()
+
+    @search_log
+    def test_binary_search_re(self, arr, key):
+        from Search.binary_search import binary_search_re
+        if not key == binary_search_re(arr, key):
+            self.fail()