fix: modify readme 🐛

Author: m9rco

README-EN.md

@@ -77,11 +77,13 @@ In this case, you know how fast these algorithms are
 
 - The running time of the algorithm increases at different speeds
   - For example, the difference between a simple find and a binary search
-    element|Easy to find|Binary search
-    ---|---|---
-    100|100ms|7ms
-    10000|10s|14ms
-    1 000 000 000 |11day|30ms
+  
+element|Easy to find|Binary search
+---|---|---
+100|100ms|7ms
+10000|10s|14ms
+1 000 000 000 |11day|30ms
+    
   - ` O ` said hair is pointed out that how fast algorithms, such as list contains ` n ` element, a simple search need to check each element, so you need to perform ` n ` time operations
     Using large ` O ` said ` O (n) to make this operation `, binary search need to perform log<sub>n</sub> using large ` O ` said to`O(log n)`
 - Some common big O runtime

README.md

@@ -77,11 +77,13 @@ left|right
 
 - 算法的运行时间以不同的速度增加
   - 例如简单查找与二分查找的区别
-    元素|简单查找|二分查找
-    ---|---|---
-    100个元素|100ms|7ms
-    10000个元素|10s|14ms
-    1 000 000 000 个元素|11天|30ms
+  
+元素|简单查找|二分查找
+---|---|---
+100个元素|100ms|7ms
+10000个元素|10s|14ms
+1 000 000 000 个元素|11天|30ms
+    
   - 大`O`表示发指出了算法有多快，例如列表包含`n`个元素，简单查找需要检查每个元素，因此需要执行`n`次操作
     使用大`O`表示发这个运行时间为`O(n)`,二分查找需要执行log<sub>n</sub>次操作，使用大`O`表示为`O(log n)`
 - 一些常见的大O运行时间