fix typo/syntax error

JuneYuan · JuneYuan · commit dacd84562e8e · 2018-08-28T15:32:58.000+08:00
diff --git a/en/basics_sorting/quick_sort.md b/en/basics_sorting/quick_sort.md
@@ -2,9 +2,9 @@
 
 In essence, quick sort is an application of `divide and conquer` strategy. There are usually three steps:
 
-Step1. Pick a pivot -- a random element.
-Step2. Partition -- put the elements smaller than pivot to its left and greater ones to its right.
-Step3. Recurse -- apply above steps until the whole sequence is sorted.
+1. Pick a pivot -- a random element.
+2. Partition -- put the elements smaller than pivot to its left and greater ones to its right.
+3. Recurse -- apply above steps until the whole sequence is sorted.
 
 ## out-in-place implementation
 
@@ -286,7 +286,7 @@ The output:
 Having analyzed three implementations of quick sort, we may grasp one key difference between *quick sort* and *merge sort* :
 
 1. Merge sort divides the original array into two sub-arrays, and merges the sorted sub-arrays to form a totally ordered one. In this case, recursion happens before processing(merging) the whole array.
-2. Quick sort divides the original array into two sub-arrays, and then sort them. The whole array is ordered as soon as the sub-arrays get sorted. In this case, recursion happens after processing(partition) the whole array.
+2. Quick sort divides the original array into two sub-arrays, and then sort them. The whole array is sorted as soon as the sub-arrays get sorted. In this case, recursion happens after processing(partition) the whole array.
 
 Robert Sedgewick's presentation on [quick sort](http://algs4.cs.princeton.edu/23quicksort/) is strongly recommended.
 
diff --git a/en/integer_array/partition_array_by_odd_and_even.md b/en/integer_array/partition_array_by_odd_and_even.md
@@ -72,4 +72,4 @@ Be careful not to forget `left < right` in while loop condition.
 
 ### Complexity
 
-To traverse the array, time complexity is $$O(n)$$. And maintain two pointers mean $$O(1)$$ space complexity.
+To traverse the array, time complexity is $$O(n)$$. And maintaining two pointers means $$O(1)$$ space complexity.
diff --git a/en/linked_list/README.md b/en/linked_list/README.md
@@ -8,6 +8,6 @@ Frequently made mistakes:
 - Not recording head node before traversing
 - returning incorrect pointer to node
 
-The image below serves as a summarization.
+The image below serves as a summarization of problems in this section.
 
 ![Linked List](../../shared-files/images/linked_list_summary_en.png)

Original file line number	Diff line number	Diff line change
@@ -72,4 +72,4 @@ Be careful not to forget `left < right` in while loop condition.
`72`	`72`
`73`	`73`	`### Complexity`
`74`	`74`
`75`		`-To traverse the array, time complexity is $$O(n)$$. And maintain two pointers mean $$O(1)$$ space complexity.`
	`75`	`+To traverse the array, time complexity is $$O(n)$$. And maintaining two pointers means $$O(1)$$ space complexity.`