creating the remaining folders

danrusei · danrusei · commit 119456faf33a · 2021-01-08T11:04:26.000+02:00
diff --git a/README.md b/README.md
@@ -79,7 +79,7 @@ WIP, the description of the below `unsolved yet` problems can be found in the or
 - [] Check if a binary tree is subtree of another binary tree
 - [] Reverse alternate levels of a perfect binary tree
 
-## Number Theory
+## [Number Theory](https://github.com/danrusei/algorithms_with_Go/tree/main/numbers)
 
 - [] Modular Exponentiation
 - [] Modular multiplicative inverse
@@ -92,7 +92,7 @@ WIP, the description of the below `unsolved yet` problems can be found in the or
 - [] Chinese remainder theorem
 - [] Lucas Theorem
 
-## BIT Manipulation
+## [BIT Manipulation](https://github.com/danrusei/algorithms_with_Go/tree/main/bitwise)
 
 - [] Maximum Subarray XOR
 - [] Magic Number
@@ -105,7 +105,7 @@ WIP, the description of the below `unsolved yet` problems can be found in the or
 - [] Count number of bits to be flipped to convert A to B
 - [] Find Next Sparse Number
 
-## String / Array
+## [String / Array](https://github.com/danrusei/algorithms_with_Go/tree/main/strings)
 
 - [] Reverse an array without affecting special characters
 - [] All Possible Palindromic Partitions
diff --git a/bitwise/README.md b/bitwise/README.md
@@ -0,0 +1,20 @@
+# Bitwise Operation
+
+In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its individual bits. It is a fast and simple action, basic to the higher level arithmetic operations and directly supported by the processor. Most bitwise operations are presented as two-operand instructions where the result replaces one of the input operands.
+
+On simple low-cost processors, typically, bitwise operations are substantially faster than division, several times faster than multiplication, and sometimes significantly faster than addition.[clarification needed] While modern processors usually perform addition and multiplication just as fast as bitwise operations due to their longer instruction pipelines and other architectural design choices, bitwise operations do commonly use less power because of the reduced use of resources.
+
+***Source: [Wikipedia](https://en.wikipedia.org/wiki/Bitwise_operation)***
+
+## Go built-in operators
+
+| Operation | Result | Description
+| ----------- | ----------- | ----------- |
+|0011 & 0101 | 0001 | Bitwise AND
+|0011 \| 0101 | 0111 | Bitwise OR
+|0011 ^ 0101 | 0110 | Bitwise XOR
+|^0101 | 1010 | Bitwise NOT (same as 1111 ^ 0101)
+|0011 &^ 0101i | 0010 | Bitclear (AND NOT)
+|00110101 << 2 | 11010100 | Left shift
+|00110101 << 100 | 00000000 | No upper limit on shift count
+|00110101 >> 2 | 00001101 | Right shift
diff --git a/numbers/README.md b/numbers/README.md
@@ -0,0 +1 @@
+#TBD
diff --git a/strings/README.md b/strings/README.md
@@ -0,0 +1 @@
+#TBD
