Commit f2a3824

KPham4588YuChengKai

authored and

YuChengKai

committed

right shift gets rid of leftover left zero(es)

fixed some typo and sentence structures in the guide

1 parent eadfb5a commit f2a3824Copy full SHA for f2a3824

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
@@ -31,7 +31,7 @@ Shift arithmetic left is to move all the binary to the left, `10` is represented
`31`	`31`	`10 >> 1 // -> 5`
`32`	`32`	```
`33`	`33`
`34`		-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.
	`34`	+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)`.
`35`	`35`
`36`	`36`	`Right shift is very useful, for example, you can calculate the intermediate value in the binary algorithm.`
`37`	`37`
`@@ -863,4 +863,4 @@ In the string correlation algorithm, Trie tree can solve many problems, and has`
`863`	`863`	`- Word frequency statistics`
`864`	`864`	`- Prefix matching`
`865`	`865`
`866`		`-If you don't know much about the Trie tree, you can go [here](../DataStruct/dataStruct-zh.md#trie) to read`
	`866`	`+If you don't know much about the Trie tree, you can go [here](../DataStruct/dataStruct-zh.md#trie) to read`

Comments

(0)