developgo
diff --git a/‎README.md
Lines changed: 1 addition & 1 deletion b/‎README.md
Lines changed: 1 addition & 1 deletion
diff --git a/‎bitwise/rotate_bits/README.md
Lines changed: 40 additions & 0 deletions b/‎bitwise/rotate_bits/README.md
Lines changed: 40 additions & 0 deletions
diff --git a/‎bitwise/rotate_bits/main.go< 10000 /a>
Lines changed: 37 additions & 0 deletions b/‎bitwise/rotate_bits/main.go< 10000 /a>
Lines changed: 37 additions & 0 deletions
@@ -98,7 +98,7 @@ WIP, the descriptions of the below `unsolved yet` problems can be found in the [
 - [] Find the element that appears once
 - [x] [Binary representation of a given number](https://github.com/danrusei/algorithms_with_Go/tree/main/bitwise/decimal_to_binary)
 - [] Count total set bits in all numbers from 1 to n
-- [] Rotate bits of a number
+- [x] [Rotate bits of a number](https://github.com/danrusei/algorithms_with_Go/tree/main/bitwise/rotate_bits)
 - [] Count number of bits to be flipped to convert A to B
 - [] Find Next Sparse Number
 
 
@@ -0,0 +1,40 @@
+# Rotate bits of a number 
+
+Source: [GeeksforGeeks](https://www.geeksforgeeks.org/rotate-bits-of-an-integer/amp/)  
+
+Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.
+
+* In left rotation, the bits that fall off at left end are put back at right end.
+* In right rotation, the bits that fall off at right end are put back at left end.
+
+## Example
+
+Let n = 3 is stored using 8 bits.
+
+* Left rotation of n = 11100101 by 3 makes n = 00101111
+* Right rotation of n = 11100101 by 3 makes n = 10111100
+
+## Algorithm
+
+Left Rotation:
+
+* n << rotate , leaves last "rotate" bits 0
+* to populate these with the first "rotate" bits of the original number
+* move first bits of the number to the end (n >> (INT_BITS - rotate))
+* and do bitwise OR with the rotated number
+
+Right Rotation:
+
+* n >> rotate , leaves first "rotate" bits 0
+* to populate these with the last "rotate" bits of the original number
+* move last bits of the number to the begining (n << (INT_BITS - rotate))
+* and do bitwise OR with the rotated number
+
+## Result
+
+```bash
+$ go run main.go 
+The number 152 in bits: 10011000
+After left rotation the number is 196 and in bits: 11000100
+After right rotation the number is 19 and in bits: 10011
+```
@@ -0,0 +1,37 @@
+package main
+
+import "fmt"
+
+// INT_BITS the number n is stored using 8 bits
+const INT_BITS = 8
+
+// function to left rotate n by rotate bits
+func rotateLeft(n int, rotate int) uint8 {
+	// n << rotate , leaves last "rotate" bits 0
+	// to populate these with the first "rotate" bits of the original number
+	// move first bits of the number to the end (n >> (INT_BITS - rotate))
+	// and do bitwise OR with the rotated number
+	return uint8((n << rotate) | (n >> (INT_BITS - rotate)))
+}
+
+// function to right rotate n by rotate bits
+func rotateRight(n int, rotate int) uint8 {
+	// n >> rotate , leaves first "rotate" bits 0
+	// to populate these with the last "rotate" bits of the original number
+	// move last bits of the number to the begining (n << (INT_BITS - rotate))
+	// and do bitwise OR with the rotated number
+	return uint8((n >> rotate) | (n << (INT_BITS - rotate)))
+}
+
+func main() {
+	n := 152
+	rotate := 3
+
+	fmt.Printf("The number %d in bits: %b\n", n, n)
+
+	rl := rotateLeft(n, rotate)
+	fmt.Printf("After left rotation the number is %d and in bits: %b\n", rl, rl)
+
+	rr := rotateRight(n, rotate)
+	fmt.Printf("After right rotation the number is %d and in bits: %b\n", rr, rr)
+}