Skip to content

Bit swap enhancement #6577

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.

Sign up for GitHub

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 3 commits into from
Oct 1, 2025
Merged

Bit swap enhancement #6577

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
4d1087f
enhance bitSwap
kunwarbhattal Sep 30, 2025
0449c4b
Merge branch 'TheAlgorithms:master' into bitSwap-enhancement
kunwarbhattal Oct 1, 2025
d0adbc3
Update BitSwap.java
kunwarbhattal Oct 1, 2025
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
5 changes: 4 additions & 1 deletion src/main/java/com/thealgorithms/bitmanipulation/BitSwap.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,12 +17,15 @@ private BitSwap() {
* @return The modified value with swapped bits
* @throws IllegalArgumentException if either position is negative or ≥ 32
*/

public static int bitSwap(int data, final int posA, final int posB) {
if (posA < 0 || posA >= Integer.SIZE || posB < 0 || posB >= Integer.SIZE) {
throw new IllegalArgumentException("Bit positions must be between 0 and 31");
}

if (SingleBitOperations.getBit(data, posA) != SingleBitOperations.getBit(data, posB)) {
boolean bitA = ((data >> posA) & 1) != 0;
boolean bitB = ((data >> posB) & 1) != 0;
if (bitA != bitB) {
data ^= (1 << posA) ^ (1 << posB);
}
return data;
Expand Down