nth element leetcode

Author: PegasusWang

docs/13_高级排序算法/quick_sort.md

@@ -125,3 +125,7 @@ T(n) = 2T(n/2) + n
 | 堆排序     | O(n\*log2n)  | O(n\*log2n)    | 不稳定 | O(1)           |
 
 [数据结构与算法-排序篇-Python描述](https://blog.csdn.net/mrlevo520/article/details/77829204<Paste>)
+
+# Leetcode
+
+https://leetcode.com/problems/kth-largest-element-in-an-array/description/