Deployed 70e55c9 with MkDocs version: 1.0.4

Author: PegasusWang

13_高级排序算法/__pycache__/quicksort.cpython-36-PYTEST.pyc

@@ -391,7 +391,7 @@ <h1 id="_5">总结</h1>
 </table>
 <p><a href="https://blog.csdn.net/mrlevo520/article/details/77829204&lt;Paste&gt;">数据结构与算法-排序篇-Python描述</a></p>
 <h1 id="leetcode">Leetcode</h1>
-<p>无序数组寻找第 k 大的数字。
+<p>无序数组寻找第 k 大的数字，不止一种方法。
 https://leetcode.com/problems/kth-largest-element-in-an-array/description/</p>
 
             </div>

13_高级排序算法/quick_sort/index.html

@@ -98,6 +98,13 @@ def test_nth_element():
     array = [3, 2, 1, 5, 6, 4]
     assert nth_element(array, 0, len(array), 2) == 2
 
+    array = [2,1]
+    assert nth_element(array, 0, len(array), 1) == 1
+    assert nth_element(array, 0, len(array), 2) == 2
+
+    array = [3,3,3,3,3,3,3,3,3]
+    assert nth_element(array, 0, len(array), 1) == 3
+
 
 if __name__ == '__main__':
     test_nth_element()

13_高级排序算法/quicksort.py

@@ -528,5 +528,5 @@ <h2 id="_20">本电子书制作和写作方式</h2>
 
 <!--
 MkDocs version : 1.0.4
-Build Date UTC : 2018-12-19 14:59:13
+Build Date UTC : 2018-12-19 15:37:20
 -->