Deployed a2fb515 with MkDocs version: 0.17.3

PegasusWang · PegasusWang · commit e8b406bb898b · 2018-04-26T22:45:49.000+08:00
diff --git a/00_课程简介之笨方法学算法/why_and_how_to_learn/index.html b/00_课程简介之笨方法学算法/why_and_how_to_learn/index.html
@@ -124,6 +124,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/01_抽象数据类型和面向对象编程/ADT_OOP/index.html b/01_抽象数据类型和面向对象编程/ADT_OOP/index.html
@@ -133,6 +133,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/02_数组和列表/array_and_list/index.html b/02_数组和列表/array_and_list/index.html
@@ -133,6 +133,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/03_链表/linked_list/index.html b/03_链表/linked_list/index.html
@@ -130,6 +130,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/04_队列/queue/index.html b/04_队列/queue/index.html
@@ -130,6 +130,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/05_栈/stack/index.html b/05_栈/stack/index.html
@@ -127,6 +127,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/06_算法分析/big_o/index.html b/06_算法分析/big_o/index.html
@@ -142,6 +142,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/07_哈希表/hashtable/index.html b/07_哈希表/hashtable/index.html
@@ -142,6 +142,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/08_字典/dict/index.html b/08_字典/dict/index.html
@@ -130,6 +130,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/09_集合/set/index.html b/09_集合/set/index.html
@@ -133,6 +133,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/10_递归/recursion/index.html b/10_递归/recursion/index.html
@@ -139,6 +139,11 @@
     <a class="" href="../../11_线性查找与二分查找/search/">线性查找与二分查找</a>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
diff --git a/11_线性查找与二分查找/search/index.html b/11_线性查找与二分查找/search/index.html
@@ -130,6 +130,11 @@
     </ul>
 	    </li>
           
+            <li class="toctree-l1">
+		
+    <a class="" href="../../12_基本排序算法/basic_sort/">基本排序算法</a>
+	    </li>
+          
         </ul>
       </div>
       &nbsp;
@@ -271,6 +276,8 @@ <h1 id="_5">延伸阅读</h1>
   
     <div class="rst-footer-buttons" role="navigation" aria-label="footer navigation">
       
+        <a href="../../12_基本排序算法/basic_sort/" class="btn btn-neutral float-right" title="基本排序算法">Next <span class="icon icon-circle-arrow-right"></span></a>
+      
       
         <a href="../../10_递归/recursion/" class="btn btn-neutral" title="递归"><span class="icon icon-circle-arrow-left"></span> Previous</a>
       
@@ -301,6 +308,8 @@ <h1 id="_5">延伸阅读</h1>
         <span><a href="../../10_递归/recursion/" style="color: #fcfcfc;">&laquo; Previous</a></span>
       
       
+        <span style="margin-left: 15px"><a href="../../12_基本排序算法/basic_sort/" style="color: #fcfcfc">Next &raquo;</a></span>
+      
     </span>
 </div>
     <script>var base_url = '../..';</script>
diff --git a/12_基本排序算法/basic_sort.py b/12_基本排序算法/basic_sort.py
@@ -0,0 +1,18 @@
+import random
+
+
+def bubble_sort(seq):  # O(n^2), n(n-1)/2 = 1/2(n^2 + n)
+    n = len(seq)
+    for i in range(n-1):
+        for j in range(n-1-i):  # 这里之所以 n-1 还需要 减去 i 是因为每一轮冒泡最大的元素都会冒泡到最后，无需再比较
+            if seq[j] > seq[j+1]:
+                seq[j], seq[j+1] = seq[j+1], seq[j]
+
+
+def test_bubble_sort():
+    # 注意 py3 返回迭代器，所以我都用 list 强转了，py2 range return list
+    seq = list(range(10))
+    random.shuffle(seq)
+    bubble_sort(seq)
+    # 注意呦，内置的 sorted 就不是 inplace 的，它返回一个新的数组，不影响传入的参数
+    assert seq == sorted(seq)
diff --git a/12_基本排序算法/basic_sort/index.html b/12_基本排序算法/basic_sort/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
