Deployed 5e02a9c with MkDocs version: 0.17.3

PegasusWang · PegasusWang · commit cc29d4877ebd · 2018-04-26T08:35:58.000+08:00
diff --git a/00_课程简介之笨方法学算法/why_and_how_to_learn/index.html b/00_课程简介之笨方法学算法/why_and_how_to_learn/index.html
@@ -119,6 +119,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/01_抽象数据类型和面向对象编程/ADT_OOP/index.html b/01_抽象数据类型和面向对象编程/ADT_OOP/index.html
@@ -128,6 +128,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/02_数组和列表/array_and_list/index.html b/02_数组和列表/array_and_list/index.html
@@ -128,6 +128,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/03_链表/linked_list/index.html b/03_链表/linked_list/index.html
@@ -125,6 +125,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/04_队列/queue/index.html b/04_队列/queue/index.html
@@ -125,6 +125,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/05_栈/stack/index.html b/05_栈/stack/index.html
@@ -122,6 +122,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/06_算法分析/big_o/index.html b/06_算法分析/big_o/index.html
@@ -137,6 +137,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/07_哈希表/hashtable/index.html b/07_哈希表/hashtable/index.html
@@ -137,6 +137,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/08_字典/dict/index.html b/08_字典/dict/index.html
@@ -125,6 +125,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/09_集合/set/index.html b/09_集合/set/index.html
@@ -128,6 +128,11 @@
     <a class="" href="../../10_递归/recursion/">递归</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/10_递归/recursion.py b/10_递归/recursion.py
@@ -50,6 +50,8 @@ def print_num_use_stack(n):
 
     while not s.is_empty():    # 参数弹出
         print(s.pop())
+
+
 def hanoi_move(n, source, dest, intermediate):
     if n >= 1:  # 递归出口，只剩一个盘子
         hanoi_move(n-1, source, intermediate, dest)
diff --git a/10_递归/recursion/index.html b/10_递归/recursion/index.html
@@ -134,6 +134,11 @@
     </ul>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
@@ -347,6 +352,8 @@ <h1 id="_8">思考题</h1>
   
     <div class="rst-footer-buttons" role="navigation" aria-label="footer navigation">
       
+        <a href="../../11_线性查找与二分查找/search/" class="btn btn-neutral float-right" title="线性查找与二分查找">Next <span class="icon icon-circle-arrow-right"></span></a>
+      
       
         <a href="../../09_集合/set/" class="btn btn-neutral" title="集合"><span class="icon icon-circle-arrow-left"></span> Previous</a>
       
@@ -377,6 +384,8 @@ <h1 id="_8">思考题</h1>
         <span><a href="../../09_集合/set/" style="color: #fcfcfc;">&laquo; Previous</a></span>
       
       
+        <span style="margin-left: 15px"><a href="../../11_线性查找与二分查找/search/" style="color: #fcfcfc">Next &raquo;</a></span>
+      
     </span>
 </div>
     <script>var base_url = '../..';</script>
diff --git a/11_线性查找与二分查找/search.py b/11_线性查找与二分查找/search.py
@@ -0,0 +1,60 @@
+# -*- coding: utf-8 -*-
+
+number_list = [0, 1, 2, 3, 4, 5, 6, 7]
+
+
+def linear_search(value, iterable):
+    for index, val in enumerate(iterable):
+        if val == value:
+            return index
+    return -1
+
+
+assert linear_search(5, number_list) == 5
+
+
+def linear_search_v2(predicate, iterable):
+    for index, val in enumerate(iterable):
+        if predicate(val):
+            return index
+    return -1
+
+
+assert linear_search_v2(lambda x: x == 5, number_list) == 5
+
+
+def linear_search_recusive(array, value):
+    if len(array) == 0:
+        return -1
+    index = len(array)-1
+    if array[index] == value:
+        return index
+    return linear_search_recusive(array[0:index], value)
+
+
+assert linear_search_recusive(number_list, 5) == 5
+assert linear_search_recusive(number_list, 8) == -1
+assert linear_search_recusive(number_list, 7) == 7
+assert linear_search_recusive(number_list, 0) == 0
+
+
+def binary_search_recursive(sorted_array, beg, end, val):
+    if beg >= end:
+        return -1
+    mid = int((beg + end) / 2)  # beg + (end-beg)/2
+    if sorted_array[mid] == val:
+        return mid
+    elif sorted_array[mid] > val:
+        return binary_search_recursive(sorted_array, beg, mid, val)    # 注意我依然假设 beg, end 区间是左闭右开的
+    else:
+        return binary_search_recursive(sorted_array, mid+1, end, val)
+
+
+def test_binary_search_recursive():
+    # 我们测试所有值和边界条件
+    a = list(range(10))
+    for i in a:
+        assert binary_search_recursive(a, 0, len(a), i) == i
+
+    assert binary_search_recursive(a, 0, len(a), -1) == -1
+    assert binary_search_recursive(a, 0, len(a), 10) == -1
diff --git a/11_线性查找与二分查找/search/index.html b/11_线性查找与二分查找/search/index.html
diff --git a/404.html b/404.html
diff --git a/index.html b/index.html
diff --git a/search.html b/search.html
diff --git a/search/search_index.json b/search/search_index.json
diff --git a/sitemap.xml b/sitemap.xml
