2020-07-10 23:22:56

docs/dsal/50.md

@@ -34,7 +34,7 @@
 
 ![undirected graph with 5 vertices](img/18f28b187d9776d58c18d7d6500ebc10.png "Undirected graph with 5 vertices")
 
-Undirected graph with 5 vertices
+具有 5 个顶点的无向图
 
 
 
@@ -42,7 +42,7 @@ Undirected graph with 5 vertices
 
 ![visit start vertex and add its adjacent vertices to queue](img/2ac803b63fc17a432956f20e411015ba.png "BFS example")
 
-Visit start vertex and add its adjacent vertices to queue
+访问起始顶点并将其相邻顶点添加到队列中
 
 
 
@@ -58,13 +58,13 @@ Visit start vertex and add its adjacent vertices to queue
 
 ![visit 2 which was added to queue earlier to add its neighbours](img/08fbea7f492fd220f096b2301c8c8bdb.png "BFS algorithm")
 
-Visit 2 which was added to queue earlier to add its neighbours
+访问 2，它已被添加到队列中来添加其邻居
 
 
 
 ![visit ](img/c78e00cb8d6b288a41096162a79d15b0.png "BFS example")
 
-4 remains in the queue
+队列中还有 4
 
 
 
@@ -72,7 +72,7 @@ Visit 2 which was added to queue earlier to add its neighbours
 
 ![visit last remaining item in stack to check if it has unvisited neighbours](img/32f60d23c17311559e1d1554d5c78bcc.png "BFS example")
 
-Visit last remaining item in stack to check if it has unvisited neighbours
+访问栈中最后剩余的项目，以检查其是否有未访问的邻居
 
 
 

docs/dsal/51.md

@@ -24,7 +24,7 @@
 
 ![negative weight cycles can give an incorrect result when trying to find out the shortest path](img/8f79460a340893e0f6c4851504ee54c4.png "Negative Weights")
 
-Negative weight cycles can give an incorrect result when trying to find out the shortest path
+负权循环可能会导致尝试找出最短路径时得出错误的结果
 
 
 
@@ -40,37 +40,37 @@ Bellman Ford 算法通过高估从起始顶点到所有其他顶点的路径长
 
 ![steps for bellman ford algorithm](img/2024fc6b64e10feea06b5112409703a7.png "Bellman Ford's algorithm steps")
 
-Step-1 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 1
 
 
 
 ![steps for bellman ford algorithm](img/ed2ad5c472478ba6e41024f217a9b09b.png "Bellman Ford's algorithm steps")
 
-Step-2 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 2
 
 
 
 ![steps for bellman ford algorithm](img/c9637271243627343061b2edd68b78cf.png "Bellman Ford's algorithm steps")
 
-Step-3 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 3
 
 
 
 ![steps for bellman ford algorithm](img/8b033d2269d69d11e1641f0967646e62.png "Bellman Ford's algorithm steps")
 
-Step-4 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 4
 
 
 
 ![steps for bellman ford algorithm](img/1d33c6cd96b36cedbffa8dc0f62bf8fa.png "Bellman Ford's algorithm steps")
 
-Step-5 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 5
 
 
 
 ![steps for bellman ford algorithm](img/fbd77d4c4c4a18a3b7bfc48a66644553.png "Bellman Ford's algorithm steps")
 
-Step-6 for Bellman Ford's algorithm
+Bellman Ford 算法的步骤 6
 
 
 
@@ -113,7 +113,7 @@ Bellman Ford 算法和 Dijkstra 算法在结构上非常相似。 虽然 Dijkstr
 
 ![Dijkstra's vs Bellman Ford's Algorithm](img/40c814a68cdc07c0388c45b2f6d656d8.png "Dijkstra's vs Bellman Ford's Algorithm")
 
-Dijkstra's vs Bellman Ford's Algorithm
+Dijkstra vs Bellman Ford 算法
 
 
 

docs/dsal/55.md

@@ -20,8 +20,7 @@
 
 ![Insertion Sort Steps](img/5356f40087d578d7c8df5799d4fc2843.png "Initial array")
 
-Initial array
-
+初始数组
 
 
 1.  假定数组中的第一个元素已排序。 取第二个元素并将其分别存储在`key`中。

docs/dsal/56.md

@@ -8,7 +8,7 @@
 
 ![merge sort example](img/3440debe7e017472b6e3ed61c62d7b39.png "Merge sort example")
 
-Merge Sort example
+归并排序示例
 
 
 
@@ -53,7 +53,7 @@ MergeSort(A, p, r):
 
 ![merge sort algorithm visualization](img/b260d5acdfeb1a0b67e39a34777a1ab5.png "Merge sort in action")
 
-Merge sort in action
+归并排序实战
 
 
 
@@ -77,7 +77,7 @@ Have we reached the end of any of the arrays?
 
 ![merge two sorted arrays](img/0b86f4acabaf05f05a10cf294158f5e5.png "Merge step")
 
-Merge step
+合并步骤
 
 
 
@@ -163,7 +163,7 @@ void merge(int arr[], int p, int q, int r) {
 
 ![Merging two consecutive subarrays of array](img/c617ee8bdfc9e90698bfb8e894a8faa8.png "Merging two consecutive subarrays of array")
 
-Merging two consecutive subarrays of array
+合并数组的两个连续子数组
 
 
 
@@ -194,7 +194,7 @@ void merge(int arr[], int p, int q, int r) {
 
 ![Create copies of subarrays for merging](img/b1c2d2682237409d9df2bc80e1d88fb5.png "Create copies of subarrays for merging")
 
-Create copies of subarrays for merging
+创建子数组的副本以进行合并
 
 
 
@@ -209,7 +209,7 @@ Create copies of subarrays for merging
 
 ![Maintain indices of copies of sub array and main array](img/dcb28f27e90ff91b2d389c8263bcf628.png "Merge Sort")
 
-Maintain indices of copies of sub array and main array
+维护子数组和主数组副本的索引
 
 
 
@@ -230,7 +230,7 @@ Maintain indices of copies of sub array and main array
 
 ![Comparing individual elements of sorted subarrays until we reach end of one](img/1add783177f65756cbc43ac8f02edf6f.png "Merge sort")
 
-Comparing individual elements of sorted subarrays until we reach end of one
+比较排序的子数组的各个元素，直到我们到达一个的结尾
 
 
 
@@ -248,7 +248,7 @@ Comparing individual elements of sorted subarrays until we reach end of one
 
 ![Copy the remaining elements from the first array to main subarray](img/ea33a8c5d48a9add55d5f75e3dae0d92.png "Merge Sort")
 
-Copy the remaining elements from the first array to main subarray
+将其余元素从第一个子数组复制到主数组
 
 
 
@@ -265,7 +265,7 @@ Copy the remaining elements from the first array to main subarray
 
 ![Copy remaining elements of second array to main subarray](img/bfbdca86100a563d673416a358de6bcb.png "Merge Sort")
 
-Copy remaining elements of second array to main subarray
+将其余元素从第二个子数组复制到主数组
 
 
 

docs/dsal/57.md

@@ -76,13 +76,13 @@
 
 ![Quick Sort Steps](img/f22e800cc6e33667304b08b82f725430.png "Quick Sort first half")
 
-Sorting the elements on the left of pivot using recursion
+使用递归对枢轴左侧的元素进行排序
 
 
 
 ![Quick Sort Steps](img/78b8af5cbc89bddf72c6913bd6623b60.png "Quick Sort second half")
 
-Sorting the elements on the right of pivot using recursion
+使用递归对枢轴右侧的元素进行排序
 
 
 

docs/dsal/59.md

@@ -12,7 +12,7 @@
 
 ![Radix Sort Working](img/b5ff9f75b681616d469048681125b773.png "Working of Radix Sort")
 
-Working of Radix Sort
+基数排序的原理