feat: update basic sortings and binary tree

chachaxw · chachaxw · commit 06b541a7c3a7 · 2021-03-10T11:39:36.000+08:00
diff --git a/README.md b/README.md
@@ -11,19 +11,17 @@ collect some good articles about data structure and algorithm.
 ![Github Stars](https://img.shields.io/github/stars/chachaxw/data-structure-and-algorithm)
 ![Github License](https://img.shields.io/github/license/chachaxw/data-structure-and-algorithm)
 
-## 🔗 相关文献(Relative Articles)
+## 🔭 学习工具(Learning Tools)
 
-1. [维基百科算法大全](https://zh.wikipedia.org/wiki/Category:算法)
-2. [维基百科数据结构大全](https://zh.wikipedia.org/wiki/Category:数据结构)
-3. [算法的时间与空间复杂度](https://shimo.im/docs/tMfuE8CWftQyEn1M/)
-4. [数据结构的基本知识总结](https://shimo.im/docs/w6lsN96M964doHUE/)
-5. [二叉树的遍历详解（前序中序后序层次-递归和非递归）](https://shimo.im/docs/MAbjWlrqWqU1f72m/)
-6. [视觉直观感受 7 种常用的排序算法](https://shimo.im/doc/8KWauxFPQUwhe5wI/)
-7. [素数生成算法](https://shimo.im/doc/j5MUwPfDObckzUHA/)
-8. [红-黑树](https://shimo.im/docs/IdtXEZbkUMQLV54a/)
-9. [堆(Heap)](https://shimo.im/docs/aH0fT9Z9trElZgsv)
-10. [图解算法数据结构](https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/55187i/)
-11. [LeetCode 刷题手册](https://books.halfrost.com/leetcode/)
+1. [LeetCode](https://leetcode.com)
+2. [领扣中国](https://leetcode-cn.com)
+3. [C++教程](http://www.runoob.com/cplusplus/cpp-tutorial.html)
+4. [看云数据结构与算法/leetcode/lintcode](https://www.kancloud.cn/kancloud/data-structure-and-algorithm-notes)
+5. [可视化算法 Algorithm Visualizer](http://algorithm-visualizer.org)
+6. [旧金山大学数据结构和算法的可视化学习工具](https://www.cs.usfca.edu/~galles/visualization/source.html)
+7. [可视化排序算法 Sorting](http://sorting.at/)
+8. [动画学习算法和数据结构 VisulaGo](https://visualgo.net/en)
+9. [普林斯顿大学经典算法教材](https://algs4.cs.princeton.edu/home/)
 
 ## 🙉 排序算法(Sorting Algorithm)
 
@@ -50,17 +48,19 @@ collect some good articles about data structure and algorithm.
 8. [堆(Heap)](https://zh.wikipedia.org/wiki/堆積)
 9. [图(Graph)](<https://zh.wikipedia.org/wiki/图_(数学)>)
 
-## 🔭 学习工具(Learning Tools)
+## 🔗 相关文献(Relative Articles)
 
-1. [LeetCode](https://leetcode.com)
-2. [领扣中国](https://leetcode-cn.com)
-3. [C++教程](http://www.runoob.com/cplusplus/cpp-tutorial.html)
-4. [看云数据结构与算法/leetcode/lintcode](https://www.kancloud.cn/kancloud/data-structure-and-algorithm-notes)
-5. [可视化算法 Algorithm Visualizer](http://algorithm-visualizer.org)
-6. [旧金山大学数据结构和算法的可视化学习工具](https://www.cs.usfca.edu/~galles/visualization/source.html)
-7. [可视化排序算法 Sorting](http://sorting.at/)
-8. [动画学习算法和数据结构 VisulaGo](https://visualgo.net/en)
-9. [普林斯顿大学经典算法教材](https://algs4.cs.princeton.edu/home/)
+1. [维基百科算法大全](https://zh.wikipedia.org/wiki/Category:算法)
+2. [维基百科数据结构大全](https://zh.wikipedia.org/wiki/Category:数据结构)
+3. [算法的时间与空间复杂度](https://shimo.im/docs/tMfuE8CWftQyEn1M/)
+4. [数据结构的基本知识总结](https://shimo.im/docs/w6lsN96M964doHUE/)
+5. [二叉树的遍历详解（前序中序后序层次-递归和非递归）](https://shimo.im/docs/MAbjWlrqWqU1f72m/)
+6. [视觉直观感受 7 种常用的排序算法](https://shimo.im/doc/8KWauxFPQUwhe5wI/)
+7. [素数生成算法](https://shimo.im/doc/j5MUwPfDObckzUHA/)
+8. [红-黑树](https://shimo.im/docs/IdtXEZbkUMQLV54a/)
+9. [堆(Heap)](https://shimo.im/docs/aH0fT9Z9trElZgsv)
+10. [图解算法数据结构](https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/55187i/)
+11. [LeetCode 刷题手册](https://books.halfrost.com/leetcode/)
 
 ## 🏷️ LeetCode 标签(LeetCode Tags)
 
diff --git a/basic_data_structure/tree/tree.cpp b/basic_data_structure/tree/tree.cpp
@@ -2,7 +2,7 @@
  * @Author: Chacha
  * @Date: 2021-03-05 19:11:18
  * @Last Modified by: Chacha
- * @Last Modified time: 2021-03-07 22:08:29
+ * @Last Modified time: 2021-03-09 15:18:46
  */
 
 #include <iostream>
@@ -31,7 +31,7 @@ struct TreeNode
  *    The variable step indicates the distance from the root node and the current node we are visiting.
  */
 
-/*
+/* 广度优先搜索
 int BFS(TreeNode root, TreeNode target)
 {
     queue<TreeNode> queue; // store all nodes which are waiting to be processed
@@ -49,6 +49,7 @@ int BFS(TreeNode root, TreeNode target)
         {
             Node cur = the first node in queue;
             return step if cur is target;
+
             for (Node next : the neighbors of cur)
             {
                 add next to queue;
@@ -87,6 +88,7 @@ int BFS(TreeNode root, TreeNode target)
         {
             Node cur = the first node in queue;
             return step if cur is target;
+
             for (Node next : the neighbors of cur)
             {
                 add next to queue;
diff --git a/basic_sorting/bubble_sort.cpp b/basic_sorting/bubble_sort.cpp
@@ -2,15 +2,15 @@
  * @Author: Chacha
  * @Date: 2018-12-13 22:10:30
  * @Last Modified by: Chacha
- * @Last Modified time: 2021-03-09 11:35:15
+ * @Last Modified time: 2021-03-09 17:14:13
  */
 
 /**
  * Bubble Sorting
  * Source: https://zh.wikipedia.org/wiki/冒泡排序
  *
  * Time Complexity: O(n^2)
- * Space Complexity: O(n^2)
+ * Space Complexity: O(1)
  *
  * 核心：冒泡，持续比较相邻元素，大的挪到后面，因此大的会逐步往后挪，故称之为冒泡。
  */
diff --git a/basic_sorting/merge_sort.cpp b/basic_sorting/merge_sort.cpp
@@ -2,7 +2,7 @@
  * @Author: Chacha
  * @Date: 2018-12-25 22:53:20
  * @Last Modified by: Chacha
- * @Last Modified time: 2021-03-04 23:19:23
+ * @Last Modified time: 2021-03-09 13:49:12
  */
 
 #include <iostream>
@@ -13,6 +13,9 @@ using namespace std;
  * 归并排序的核心：将两个有序对数组归并成一个更大对有序数组。
  * 通常做法为递归排序，并将两个不同的有序数组归并到第三个数组中。
  *
+ * Time Complexity: O(n log n)
+ * Space Complexity: O(n)
+ *
  * Source:
  *  https://zh.wikipedia.org/wiki/归并排序
  *  https://algs4.cs.princeton.edu/22mergesort/
diff --git a/basic_sorting/quick_sort.cpp b/basic_sorting/quick_sort.cpp
@@ -2,7 +2,7 @@
  * @Author: Chacha
  * @Date: 2018-12-29 23:03:23
  * @Last Modified by: Chacha
- * @Last Modified time: 2019-01-13 08:46:13
+ * @Last Modified time: 2021-03-10 10:01:20
  */
 
 #include <iostream>
@@ -15,7 +15,7 @@ using namespace std;
  *  https://algs4.cs.princeton.edu/23quicksort/
  *
  * Time Complexity: O(n log n) (the badest situation is O(n^2))
- * Space Complexity: O (log n)
+ * Space Complexity: O(log n)
  *
  * The solution:
  *  1. Find a pivot element x;
diff --git a/basic_sorting/selection_sort.cpp b/basic_sorting/selection_sort.cpp
@@ -2,12 +2,23 @@
  * @Author: Chacha
  * @Date: 2018-12-20 22:00:30
  * @Last Modified by: Chacha
- * @Last Modified time: 2018-12-20 22:39:02
+ * @Last Modified time: 2021-03-09 14:23:30
  */
 
 /**
  * Selection Sorting
  * Source: https://zh.wikipedia.org/wiki/选择排序
+ *
+ * 核心：不断地选择剩余元素中的最小者。
+ *
+ * 1. 找到数组中最小元素并将其和数组第一个元素交换位置。
+ * 2. 在剩下的元素中找到最小元素并将其与数组第二个元素交还，直至整个数组排序。
+ *
+ * 性质
+ * 1. 比较次数 = (n - 1) + (n - 2) + (n - 3) + ... + 2 + 1 ≈ n^2/2
+ * 2. 交还次数 = N
+ * 3. 运行时间与输入无关
+ * 4. 数据移动最少
  */
 
 #include <iostream>
diff --git a/basic_sorting/sorting_selection.gif b/basic_sorting/sorting_selection.gif
diff --git a/binarytree/binary_tree.cpp b/binarytree/binary_tree.cpp

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`* @Author: Chacha`
`3`	`3`	`* @Date: 2021-03-05 19:11:18`
`4`	`4`	`* @Last Modified by: Chacha`
`5`		`- * @Last Modified time: 2021-03-07 22:08:29`
	`5`	`+ * @Last Modified time: 2021-03-09 15:18:46`
`6`	`6`	`*/`
`7`	`7`
`8`	`8`	`#include <iostream>`
`@@ -31,7 +31,7 @@ struct TreeNode`
`31`	`31`	`* The variable step indicates the distance from the root node and the current node we are visiting.`
`32`	`32`	`*/`
`33`	`33`
`34`		`-/*`
	`34`	`+/* 广度优先搜索`
`35`	`35`	`int BFS(TreeNode root, TreeNode target)`
`36`	`36`	`{`
`37`	`37`	`queue<TreeNode> queue; // store all nodes which are waiting to be processed`
`@@ -49,6 +49,7 @@ int BFS(TreeNode root, TreeNode target)`
`49`	`49`	`{`
`50`	`50`	`Node cur = the first node in queue;`
`51`	`51`	`return step if cur is target;`
	`52`	`+`
`52`	`53`	`for (Node next : the neighbors of cur)`
`53`	`54`	`{`
`54`	`55`	`add next to queue;`
`@@ -87,6 +88,7 @@ int BFS(TreeNode root, TreeNode target)`
`87`	`88`	`{`
`88`	`89`	`Node cur = the first node in queue;`
`89`	`90`	`return step if cur is target;`
	`91`	`+`
`90`	`92`	`for (Node next : the neighbors of cur)`
`91`	`93`	`{`
`92`	`94`	`add next to queue;`