Why Reverse Bits of a Number in DSA Rust?

The Big Idea

What if you could flip all the bits of a number in just a few steps, no matter how big it is?

The Scenario

Imagine you have a number represented in binary, like a row of light switches, each either on or off. You want to flip the order of these switches so the first becomes last, the second becomes second last, and so on.

Doing this by hand means checking each switch one by one and moving it to the new position, which is slow and confusing.

The Problem

Manually reversing bits is error-prone because you must carefully track each bit's position. It's easy to lose count or mix up positions, especially with many bits.

This process is slow and tedious if done without a clear method or tool.

The Solution

Using a simple algorithm, we can reverse bits by shifting and masking bits efficiently. This method automatically moves each bit to its reversed position without manual counting.

It's fast, reliable, and works for any number size.

Before vs After

✗ Before

let mut reversed = 0;
for i in 0..32 {
    let bit = (number >> i) & 1;
    reversed |= bit << (31 - i);
}

✓ After

fn reverse_bits(mut number: u32) -> u32 {
    let mut reversed = 0;
    for _ in 0..32 {
        reversed = (reversed << 1) | (number & 1);
        number >>= 1;
    }
    reversed
}

What It Enables

This lets you quickly flip the order of bits in a number, enabling tasks like data encoding, cryptography, and low-level hardware control.

Real Life Example

In image processing, reversing bits can help flip pixel data for certain formats or hardware that read bits in reverse order.

Key Takeaways

Manual bit reversal is slow and error-prone.

Algorithmic bit reversal uses shifting and masking for speed and accuracy.

This technique is useful in many computing fields like cryptography and hardware interfacing.

Practice

1. What does the operation of reversing bits of a number mean in simple terms?

easy

A. Adding 1 to the binary number

B. Changing all 0s to 1s and 1s to 0s

C. Flipping the order of bits from left to right

D. Shifting bits to the left by one position

Solution

1. Step 1: Understand bit representation

   Bits are the 0s and 1s that represent a number in binary form.

2. Step 2: Define reversing bits

   Reversing bits means reading the bits from right to left instead of left to right, effectively flipping their order.

3. Final Answer:

   Flipping the order of bits from left to right -> Option C

4. Quick Check:

   Reverse bits = flip order [OK]

Hint: Reverse bits means flip their order, not invert values [OK]

Common Mistakes:

• Confusing reversing bits with bitwise NOT (inverting bits)
• Thinking reversing means shifting bits
• Assuming reversing adds or subtracts from the number

2. Which Rust code snippet correctly reverses the bits of a 4-bit unsigned integer n?

easy

A. let mut rev = 0; for _ in 0..4 { rev <<= 1; rev |= n & 1; n >>= 1; }

B. let mut rev = 0; for _ in 0..4 { rev |= n & 1; rev <<= 1; n >>= 1; }

C. let mut rev = 0; for _ in 0..4 { rev += n & 1; n <<= 1; }

D. let mut rev = 0; for _ in 0..4 { rev <<= 1; rev |= n << 1; n >>= 1; }

Solution

1. Step 1: Analyze bit reversal logic

   We shift rev left by 1, add the least significant bit of n, then shift n right by 1.

2. Step 2: Check each option

   let mut rev = 0; for _ in 0..4 { rev <<= 1; rev |= n & 1; n >>= 1; } correctly does rev <<= 1; rev |= n & 1; n >>= 1; in loop. Others have wrong order or operations.

3. Final Answer:

   let mut rev = 0; for _ in 0..4 { rev <<= 1; rev |= n & 1; n >>= 1; } -> Option A

4. Quick Check:

   Shift rev left, add bit, shift n right [OK]

Hint: Shift rev left before adding bit, shift n right after [OK]

Common Mistakes:

• Adding bit before shifting rev left
• Shifting n left instead of right
• Using addition instead of bitwise OR

3. What is the output of the following Rust code snippet?

fn reverse_bits(mut n: u8) -> u8 {
    let mut rev = 0;
    for _ in 0..8 {
        rev <<= 1;
        rev |= n & 1;
        n >>= 1;
    }
    rev
}

fn main() {
    let num = 13u8; // binary 00001101
    println!("{}", reverse_bits(num));
}

medium

A. 176

B. 11

C. 101

D. 208

Solution

1. Step 1: Convert 13 to binary and reverse bits

   13 in 8 bits is 00001101. Reversing bits gives 10110000.

2. Step 2: Convert reversed bits back to decimal

   10110000 binary equals 128+32+16=176 decimal.

3. Final Answer:

   176 -> Option A

4. Quick Check:

   00001101 reversed = 10110000 = 176 [OK]

Hint: Reverse bits visually, then convert binary to decimal [OK]

Common Mistakes:

• Not using 8 bits, missing leading zeros
• Confusing bit order or reversing incorrectly
• Calculating decimal value wrong

4. Identify the bug in this Rust function that attempts to reverse bits of a 4-bit number:

fn reverse_bits(mut n: u8) -> u8 {
    let mut rev = 0;
    for _ in 0..4 {
        rev |= n & 1;
        rev <<= 1;
        n >>= 1;
    }
    rev
}

medium

A. Using bitwise OR instead of addition

B. Shifting rev left after adding bit causes incorrect result

C. Not shifting n left instead of right

D. Loop should run 8 times for 4-bit number

Solution

1. Step 1: Analyze order of operations in loop

   rev |= n & 1 adds bit, then rev <<= 1 shifts left, causing last bit to be zeroed out.

2. Step 2: Correct order is shift rev left first, then add bit

   Shifting rev left after adding bit loses the last bit added, so order must be reversed.

3. Final Answer:

   Shifting rev left after adding bit causes incorrect result -> Option B

4. Quick Check:

   Shift rev left before OR bit [OK]

Hint: Shift rev left before OR bit to avoid losing bits [OK]

Common Mistakes:

• Adding bit before shifting rev left
• Loop count mismatch for bit size
• Shifting n left instead of right

5. Given a 16-bit unsigned integer, how would you efficiently reverse its bits using Rust's built-in methods combined with bitwise operations?

hard

A. Manually loop 16 times shifting bits and reconstruct reversed number

B. Use n.swap_bytes() to reverse bits

C. Convert number to string, reverse characters, then parse back

D. Use n.reverse_bits() method directly on the number

Solution

1. Step 1: Know Rust's built-in bit reversal

   Rust's primitive integer types have a reverse_bits() method that reverses bits efficiently.

2. Step 2: Compare options

   Use n.reverse_bits() method directly on the number uses the built-in method directly, which is efficient and simple. Others are manual or incorrect methods.

3. Final Answer:

   Use n.reverse_bits() method directly on the number -> Option D

4. Quick Check:

   Use built-in reverse_bits() for efficiency [OK]

Hint: Use built-in reverse_bits() method for fast bit reversal [OK]

Common Mistakes:

• Trying manual loops instead of built-in method
• Confusing byte swap with bit reversal
• Using string conversion which is inefficient