Skip to content

Add Reverse Bits Algo in Bit-Manipulation #4299

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Aug 12, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -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;
}
}
Original file line number Diff line number Diff line change
@@ -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));
}
}