decimal to binary

danrusei · danrusei · commit 68cabe8d2dfc · 2021-01-11T11:45:36.000+02:00
diff --git a/bitwise/decimal_to_binary/README.md b/bitwise/decimal_to_binary/README.md
@@ -0,0 +1,18 @@
+# Binary representation of a given number
+
+Source: [GeeksforGeeks](https://www.geeksforgeeks.org/binary-representation-of-a-given-number/amp/)
+Write a program to print Binary representation of a given number.
+
+## Algorithm
+
+Recursive using bitwise operator
+
+* Check n > 1
+* **right shift** the number by 1 bit and recursive call the function
+* Print the bits of number
+
+Alternate solution is to use fmt Go package to transform decimal to binary:
+
+```go
+fmt.Printf("The binary of the %d is: %b\n", x, x)
+```
diff --git a/bitwise/decimal_to_binary/main.go b/bitwise/decimal_to_binary/main.go
@@ -0,0 +1,22 @@
+package main
+
+import "fmt"
+
+// recursively call this function untill all bits are shifted
+func bin(x int) {
+
+	if x > 1 {
+		bin(x >> 1)
+	}
+	// print last bit from the remainder
+	fmt.Printf("%d", x&1)
+}
+
+func main() {
+	x := 131
+	fmt.Printf("Using recursive function, the binary of %d is: ", x)
+	bin(x)
+	fmt.Println()
+	//builtin using fmt package
+	fmt.Printf("Using fmt package, the binary of %d is: %b\n", x, x)
+}
diff --git a/bitwise/max_xor/README.md b/bitwise/max_xor/README.md
@@ -1,5 +1,6 @@
 # Find the maximum subarray XOR in a given array
 
+Source: [GeeksforGeeks](https://www.geeksforgeeks.org/find-the-maximum-subarray-xor-in-a-given-array/amp/)  
 Given an array of integers. find the maximum XOR subarray value in given array. Expected time complexity O(n).
 
 > Input: arr[] = {1, 2, 3, 4}  
