Update README-en.md

Author: kdgyun

README-en.md

@@ -110,14 +110,14 @@ func main() {
 
 [array length : 100000]
 make arrays...
-runing bubble sort...
-runing cocktail sort...
+running bubble sort...
+running cocktail sort...
 
 ...
 
-runing intro sort...
-runing parallel intro sort...
-runing cycle sort...
+running intro sort...
+running parallel intro sort...
+running cycle sort...
 
 +-------------------------------------------------------------------------------------------------+
 |                                name |                      ns |                 ms |     verify |      (err mag) 
@@ -613,4 +613,4 @@ Comb sort is a relatively simple sorting algorithm originally designed by Włodz
 
 | Worst-Case | Average-Case | Best-Case | in-place | stable | Space Complexity |
 | :-: | :-: | :-: | :-: | :-: | :-: |
-| ![O(n^2)](https://latex.codecogs.com/svg.image?O(n^{2})) | ![O(n^2/p^2)](https://latex.codecogs.com/svg.image?O(n^{2}/2^{p})) | ![O(nlog_n)](https://latex.codecogs.com/svg.image?O(n\log&space;n)) | Yes | No | total : ![O(n)](https://latex.codecogs.com/svg.image?O(n)), auxiliary : ![O(1)](https://latex.codecogs.com/svg.image?O(1)) |
+| ![O(n^2)](https://latex.codecogs.com/svg.image?O(n^{2})) | ![O(n^2/p^2)](https://latex.codecogs.com/svg.image?O(n^{2}/2^{p})) | ![O(nlog_n)](https://latex.codecogs.com/svg.image?O(n\log&space;n)) | Yes | No | total : ![O(n)](https://latex.codecogs.com/svg.image?O(n)), auxiliary : ![O(1)](https://latex.codecogs.com/svg.image?O(1)) |