right shift gets rid of leftover left zero(es)

Algorithm/algorithm-en.md

@@ -31,7 +31,7 @@ Shift arithmetic left is to move all the binary to the left, `10` is represented
 10 >> 1 // -> 5
 ```
 
-The right shift of the arithmetic is to move all the binary to the right and remove the extra right. `10` is represented as `1010` in binary, and becomes `101` after shifting one bit to the right, and converted to decimal is 5, so the right shift is seen as the following formula `a >> b => a / (2 ^ b)` by basically.
+The bitwise right shift moves all the binary digits to the right and remove the extra left digit. `10` is represented as `1010` in binary, and becomes `101` after shifting one bit to the right, and becomes 5 in decimal value, so the right shift is basically the following formula: `a >> b => a / (2 ^ b)`.
 
 Right shift is very useful, for example, you can calculate the intermediate value in the binary algorithm.
 
@@ -863,4 +863,4 @@ In the string correlation algorithm, Trie tree can solve many problems, and has
 - Word frequency statistics
 - Prefix matching
 
-If you don't know much about the Trie tree, you can go [here](../DataStruct/dataStruct-zh.md#trie)  to read
+If you don't know much about the Trie tree, you can go [here](../DataStruct/dataStruct-zh.md#trie)  to read