@@ -8,7 +8,7 @@ pattern like `0001`. This clears all bits from the original
88number except the relevant one. If the relevant bit is one,
99the result is ` 1 ` , otherwise the result is ` 0 ` .
1010
11- > See ` getBit ` function for further details.
11+ > See [ getBit.js ] ( getBit.js ) for further details.
1212
1313#### Set Bit
1414
@@ -17,7 +17,7 @@ value that looks like `00100`. Then we perform `OR` operation
1717that sets specific bit into ` 1 ` but it does not affect on
1818other bits of the number.
1919
20- > See ` setBit ` function for further details.
20+ > See [ setBit.js ] ( setBit.js ) for further details.
2121
2222#### Clear Bit
2323
@@ -27,13 +27,13 @@ the number that looks like `11011`. Then `AND` operation is
2727being applied to both the number and the mask. That operation
2828unsets the bit.
2929
30- > See ` clearBit ` function for further details.
30+ > See [ clearBit.js ] ( clearBit.js ) for further details.
3131
3232#### Update Bit
3333
3434This method is a combination of "Clear Bit" and "Set Bit" methods.
3535
36- > See ` updateBit ` function for further details.
36+ > See [ updateBit.js ] ( updateBit.js ) for further details.
3737
3838#### Multiply By Two
3939
@@ -52,7 +52,7 @@ Number: 0b1010 = 10
5252Powers of two: 2^3 + 0 + 2^1 + 0
5353```
5454
55- > See ` multiplyByTwo ` function for further details.
55+ > See [ multiplyByTwo.js ] ( multiplyByTwo.js ) for further details.
5656
5757#### Divide By Two
5858
@@ -71,7 +71,7 @@ Number: 0b0010 = 2
7171Powers of two: 0 + 0 + 2^1 + 0
7272```
7373
74- > See ` divideByTwo ` function for further details.
74+ > See [ divideByTwo.js ] ( divideByTwo.js ) for further details.
7575
7676#### Switch Sign
7777
@@ -89,7 +89,7 @@ inverting all of the bits of the number and adding 1 to it.
89890011 3
9090```
9191
92- > See ` switchSign ` function for further details.
92+ > See [ switchSign.js ] ( switchSign.js ) for further details.
9393
9494#### Multiply Two Numbers
9595
@@ -114,7 +114,7 @@ x * 19 = x * 2^4 + x * 2^1 + x * 2^0
114114Now we need to remember that ` x * 2^4 ` is equivalent of shifting ` x ` left
115115by ` 4 ` bits (` x << 4 ` ).
116116
117- > See ` multiplyUnsigned ` function for further details.
117+ > See [ multiplyUnsigned.js ] ( multiplyUnsigned.js ) for further details.
118118
119119#### Count Set Bits
120120
@@ -127,7 +127,7 @@ Number: 5 = 0b0101
127127Count of set bits = 2
128128```
129129
130- > See ` countSetBits ` function for further details.
130+ > See [ countSetBits.js ] ( countSetBits.js ) for further details.
131131
132132#### Count Bits to Flip One Number to Another
133133
@@ -141,7 +141,7 @@ of different bits.
141141Count of Bits to be Flipped: 1
142142```
143143
144- > See ` bitsDiff ` function for further details.
144+ > See [ bitsDiff.js ] ( bitsDiff.js ) for further details.
145145
146146#### Count Bits of a Number
147147
@@ -154,7 +154,7 @@ Count of valuable bits is: 3
154154When we shift 1 four times it will become bigger than 5.
155155```
156156
157- > See [ bitLength] ( bitLength.js ) function for further details.
157+ > See [ bitLength.js ] ( bitLength.js ) for further details.
158158
159159## References
160160
0 commit comments