list time complexity title

zpoint · Aug 13, 2019 · 3ed8c2f · 3ed8c2f
1 parent 26cb866
commit 3ed8c2f
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 0 deletions.
diff --git a/BasicObject/list/list.md b/BasicObject/list/list.md
@@ -12,6 +12,7 @@
 	* [galloping mode](#galloping-mode)
 	* [binary_sort](#binary_sort)
 	* [run](#run)
+	* [time complexity](#time-complexity)
 * [free_list](#free_list)
 * [read more](#read-more)
 
@@ -307,6 +308,8 @@ I've changed this const to a smaller value so that the example above can fit int
         return n + r;
     }
 
+## time complexity
+
 time complexity of [timsort](#timsort)
 
 ![complexity](https://github.com/zpoint/CPython-Internals/blob/master/BasicObject/list/complexity.png)

diff --git a/BasicObject/list/list_cn.md b/BasicObject/list/list_cn.md
@@ -12,6 +12,7 @@
 	* [galloping mode](#galloping-mode)
 	* [binary_sort](#binary_sort)
 	* [run](#run)
+	* [时间复杂度](#时间复杂度)
 * [free_list(缓冲池)](#free_list)
 * [更多资料](#更多资料)
 
@@ -304,6 +305,8 @@ CPyton 用来对 `list` 对象排序的算法名称叫做 **timsort**, 它有一
         return n + r;
     }
 
+## 时间复杂度
+
 [timsort](#timsort) 的时间复杂度如下
 
 ![complexity](https://github.com/zpoint/CPython-Internals/blob/master/BasicObject/list/complexity.png)