Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Invert actual bits of a number

  • Difficulty Level : Easy

Given a non-negative integer n. The problem is to invert the bits of n and print the number obtained after inverting the bits. Note that the actual binary representation of the number is being considered for inverting the bits, no leading 0’s are being considered. 
 

Examples: 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input : 11
Output : 4
(11)10 = (1011)[2]
After inverting the bits, we get:
(0100)2 = (4)10.

Input : 10
Output : 5
(10)10 = (1010)2.
After reversing the bits we get:
(0101)2 = (101)2
        = (5)10.

Method 1 (Using bitwise operators)
Prerequisite: Toggling k-th bit of a number 
 



C++




// CPP program to invert actual bits
// of a number.
#include <bits/stdc++.h>
using namespace std;
 
void invertBits(int num)
{
    // calculating number of bits
    // in the number
    int x = log2(num) + 1;
 
    // Inverting the bits one by one
    for (int i = 0; i < x; i++)
       num = (num ^ (1 << i));
  
    cout << num;
}
 
// Driver code
int main()
{
    int num = 11;
    invertBits(num);
    return 0;
}
Java



// Java program to invert
// actual bits of a number.
import java.io.*;
 
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of
        // bits in the number
        int x = (int)(Math.log(num) /
                      Math.log(2)) + 1;
     
        // Inverting the
        // bits one by one
        for (int i = 0; i < x; i++)
        num = (num ^ (1 << i));
     
        System.out.println(num);
    }
     
    // Driver code
    public static void main (String[] args)
    {
        int num = 11;
        invertBits(num);
    }
 
}
 
// This code is contributed
// by Anuj_67
Python3



# Python3 program to invert actual
# bits of a number.
import math
 
def invertBits(num):
 
    # calculating number of bits
    # in the number
    x = int(math.log2(num)) + 1
 
    # Inverting the bits one by one
    for i in range(x):
        num = (num ^ (1 << i))
     
    print(num)
 
# Driver Code
num = 11
invertBits(num)
 
# This code is contributed
# by Rituraj Jain
C#



// C# program to invert
// actual bits of a number.
using System;
 
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of
        // bits in the number
        int x = (int)(Math.Log(num) /
                       Math.Log(2)) + 1;
     
        // Inverting the
        // bits one by one
        for (int i = 0; i < x; i++)
        num = (num ^ (1 << i));
     
        Console.WriteLine(num);
    }
     
    // Driver code
    public static void Main ()
    {
        int num = 11;
        invertBits(num);
    }
 
}
 
// This code is contributed
// by Anuj_67
PHP



<?php
// PHP program to invert actual bits
// of a number.
 
function invertBits( $num)
{
     
    // calculating number of bits
    // in the number
    $x = log($num) + 1;
 
    // Inverting the bits one by one
    for($i = 0; $i < $x; $i++)
    $num = ($num ^ (1 << $i));
 
    echo $num;
}
 
    // Driver code
    $num = 11;
    invertBits($num);
     
// This code is contributed by anuj_67.
?>
Javascript



<script>
 
    // Javascript program to invert
    // actual bits of a number.
     
    function invertBits(num)
    {
        // calculating number of
        // bits in the number
        let x =
        parseInt(Math.log(num) / Math.log(2), 10) + 1;
       
        // Inverting the
        // bits one by one
        for (let i = 0; i < x; i++)
            num = (num ^ (1 << i));
       
        document.write(num);
    }
     
    let num = 11;
      invertBits(num);
 
</script>
Output: 
4
 
Time complexity : O(log n) 
Auxiliary space : O(1)
Method 2 (Using Bitset) 
Here we use the flip() of bitset to invert the bits of the number, in order to avoid flipping the leading zeroes in the binary representation of the number, we have calculated the number of bits in the binary representation and flipped only the actual bits of the number. We have used to_ulong() to convert bitset to number.
 
C++



// CPP program to invert actual bits
// of a number.
#include <bits/stdc++.h>
using namespace std;
 
void invertBits(int num)
{
    // calculating number of bits
    // in the number
    int x = log2(num) + 1;
 
    // Considering number to be 32 bit integer;
    bitset<32> b(num);
 
    // reversing the bits one by one
    for (int i = 0; i < x; i++)
        b.flip(i);
 
    // converting bitset to number
    cout << b.to_ulong();
}
 
// Driver code
int main()
{
    int num = 11;
    invertBits(num);
    return 0;
}
Java



// Java program to invert actual
// bits of a number.
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of
        // bits in the number
        int x = (int)(Math.log(num) /
                      Math.log(2)) + 1;
     
        // Inverting the bits
        // one by one
         
        for (int i = 0; i < x; i++)
        num = (num ^ (1 << i));
     
        System.out.print(num);
    }
     
    // Driver code
    public static void main(String[] args)
    {
        int num = 11;
        invertBits(num);
    }
}
 
// This code is contributed by Mukul Singh
Python 3



# Python 3 program to invert actual
# bits of a number.
import math
 
def invertBits(num):
     
    # calculating number of
    # bits in the number
    x = int(math.log(num, 2.0) + 1);
 
    # Inverting the bits
    # one by one
    for i in range(0, x):
        num = (num ^ (1 << i));
 
    print(num);
 
# Driver code
num = 11;
invertBits(num);
 
# This code is contributed
# by Akanksha Rai
C#



// C# program to invert actual
// bits of a number.
using System;
 
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of
        // bits in the number
        int x = (int)Math.Log(num, 2) + 1;
     
        // Inverting the bits
        // one by one
        for (int i = 0; i < x; i++)
        num = (num ^ (1 << i));
     
        Console.Write(num);
    }
     
    // Driver code
    static void Main()
    {
        int num = 11;
        invertBits(num);
    }
 
}
 
// This code is contributed by Anuj_67
PHP



<?php
// PHP program to invert actual
// bits of a number.
function invertBits($num)
{
    // calculating number of
    // bits in the number
    $x = log($num) + 1;
 
    // Inverting the bits
    // one by one
    for ($i = 0; $i < $x; $i++)
    $num = ($num ^ (1 << $i));
 
        echo $num;
}
 
// Driver code
$num = 11;
invertBits($num);
 
// This code is contributed
// by ajit
?>
Javascript



<script>
    // Javascript program to invert actual bits of a number.
     
    function invertBits(num)
    {
        // calculating number of
        // bits in the number
        let x = Math.log(num, 2) + 1;
       
        // Inverting the bits
        // one by one
        for (let i = 0; i < x; i++)
        num = (num ^ (1 << i));
       
        document.write(num);
    }
     
    let num = 11;
      invertBits(num);
 
</script>
Output : 
4
 
Time complexity: O(log n) 
Auxiliary space: O(1)
Method 3 (Using bitmask):
Here, we will create a mask by setting all the bits from MSB(including MSB) and then take XOR with the original number
C++



// CPP program to invert actual bits
// of a number.
#include <bits/stdc++.h>
using namespace std;
 
void invertBits(int num)
{
    // calculating the mask
    int x = num;     // say num = 100000
      x |= x >> 1;    // 100000 | 010000 = 110000
      x |= x >> 2;    // 110000 | 001100 = 111100
      x |= x >> 4;    // 111100 | 000011 = 111111
      x |= x >> 8;    // 111111 | 000000 = 111111
      x |= x >> 16;    // 111111 | 000000 = 111111
  
    cout << (num ^ x); // 100000 | 111111 = 011111
}
 
// Driver code
int main()
{
    int num = 11;
    invertBits(num);
    return 0;
}
Output:
4
Time complexity: O(1) 
Auxiliary space: O(1)
 



My Personal Notes
arrow_drop_up
Next

Program to invert bits of a number Efficiently
Recommended Articles
Page :
Reverse actual bits of the given number
10, Jan 18
Program to invert bits of a number Efficiently
28, Sep 18
Check if actual binary representation of a number is palindrome
11, Jan 18
Invert the Kth most significant bit of N
02, Jan 20
Toggle bits of a number except first and last bits
14, Jan 18
Check if bits of a number has count of consecutive set bits in increasing order
12, Jan 17
Print numbers having first and last bits as the only set bits
15, Jan 18
Check if all bits can be made same by flipping two consecutive bits
09, Jan 20
Flip bits of the sum of count of set bits of two given numbers
03, Jan 21
Count of pairs {X, Y} from an array such that sum of count of set bits in X ⊕ Y and twice the count of set bits in X & Y is M
12, Mar 21
Minimize cost of swapping set bits with unset bits in a given Binary string
18, Aug 21
Next higher number with same number of set bits
08, Feb 11
Number of integers with odd number of set bits
21, May 18
Minimum number using set bits of a given number
09, May 18
Check if a number has same number of set and unset bits
30, Jul 18
Find the largest number smaller than integer N with maximum number of set bits
26, Apr 20
M-th smallest number having k number of set bits.
24, Sep 17
Maximize a given unsigned number number by swapping bits at it's extreme positions.
18, Jul 17
Write an Efficient C Program to Reverse Bits of a Number
02, Aug 09
Count number of bits to be flipped to convert A to B
05, Sep 09
Rotate bits of a number
31, Oct 09
Program to count number of set bits in an (big) array
12, Mar 11
Swap bits in a given number
27, Apr 12
Toggle all the bits of a number except k-th bit.
01, Jun 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
coder_11
@coder_11
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!