Add Reverse Bits Algo in Bit-Manipulation (TheAlgorithms#4299)

BamaCharanChhandogi · BamaCharanChhandogi · web-flow · commit 251157059c98 · 2023-08-12T15:55:10.000Z
Co-authored-by: BamaCharanChhandogi &lt;b.c.chhandogi@gmailcom&gt;
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java b/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java
@@ -0,0 +1,20 @@
+package com.thealgorithms.bitmanipulation;
+
+/**
+ * Converts any Octal Number to a Binary Number
+ * @author Bama Charan Chhandogi
+ */
+
+public class ReverseBits {
+
+    public static int reverseBits(int n) {
+        int result = 0;
+        int bitCount = 32;
+        for (int i = 0; i < bitCount; i++) {
+            result <<= 1; // Left shift the result to make space for the next bit
+            result |= (n & 1); // OR operation to set the least significant bit of result with the current bit of n
+            n >>= 1; // Right shift n to move on to the next bit
+        }
+        return result;
+    }
+}
diff --git a/src/test/java/com/thealgorithms/bitmanipulation/ReverseBitsTest.java b/src/test/java/com/thealgorithms/bitmanipulation/ReverseBitsTest.java
@@ -0,0 +1,15 @@
+package com.thealgorithms.bitmanipulation;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class ReverseBitsTest {
+
+    @Test
+    void testReverseBits() {
+        assertEquals(0, ReverseBits.reverseBits(0));
+        assertEquals(-1, ReverseBits.reverseBits(-1));
+        assertEquals(964176192, ReverseBits.reverseBits(43261596));
+    }
+}
