Clear right most set bit of an integer n

 

#include <iostream> 
using namespace std; 
  
//function to clear rightmost set bit of integer n
unsigned clearRightMostSetBit(unsigned int n) 
{ 
    int result = n & (n - 1); 
    return result; 
} 
  
int main() 
{ 
    unsigned int n = 8;
    unsigned int result = clearRightMostSetBit(n);
    cout << "After clearing right most set bit of integer "<< n << ", we get  "<< result<<"." << endl; 
    return 0; 
}

Comments

Post a Comment

Popular posts from this blog

Swap bits at ith and jth position of integer n

  #include <iostream> using namespace std; //function to swap bits of an integer n unsigned swapBit(unsigned int n, unsigned int i, unsigned int j) { if(( n & (1 << (i-1))) != (n & (1 << (j-1)))){ n ^= (1 << (i-1)) ^ (1 << (j-1)); } return n; } int main() { unsigned int n = 7, i = 1, j = 4 ; unsigned int result = swapBit(n,i,j); cout << "After swapping the bit at position "<< i <<" and "<< j << " of integer "<< n << ", we get "<< result<<"." << endl; return 0; }
Read more

Toggle the bit at Kth position of integer n

Image
  #include <iostream> using namespace std; //function to toggle Kth bit of integer n unsigned toggleBit(unsigned int n, unsigned int k) { int result = n ^ (1 <<(k - 1)); return result; } int main() { unsigned int n = 10, k = 1; unsigned int result = toggleBit(n, k); cout << "After toggling bit of position " << k << " integer "<< n << ", we get "<< result<<"." << endl; return 0; }
Read more