# Tag - c xor

## swap two numbers without using a temporary variable

swap two numbers without using a temporary variable-Bit Algorithm-Given two variables, x and y, swap two variables without using a third variable.

Bit Algorithms:

## Position of rightmost set bit

Write a one line C function to return position of first 1 from right to left, in binary representation of an Integer.

## Count set bits in an integer in C Programming

Count set bits in an integer in C Programming - Bit Algorithm - Simple Method Loop through all bits in an integer, check if bit is set and if then increment

## C Program to Reverse Bits of a Number

C Program to Reverse Bits of a Number - Bit Algorithm - Given an unsigned integer, reverse all bits of it and return the number with reversed bits.

## Rotate bits of a number

Rotate bits of a number - Bit Algorithm - A rotation (or circular shift)is an operation similar to shift except that the bits that fall off at one end

## Compute the integer absolute value (abs) without branching

Compute the integer absolute value without branching - Bit Algorithm - We need not do anything if a no is positive. We want to change only negative numbers.

## Next higher number with same number of set bits

Next higher number with same number of set bits - Bit Algorithm - When we observe the binary sequence from 0 to 2n – 1 (n is # of bits),The idea is to find...

## Program to count number of set bits in an (big) array

Program to count number of set bits in an (big) array- Bit Algorithm - The simple approach would be, create an efficient method to count set bits in a word.

## Swap bits in a given number

Swap bits in a given number - Bit Algorithm - Given a number x and two positions (from right side) in binary representation of x, write a function that swap

## Count total set bits in all numbers from 1 to n

Count total set bits in all numbers from 1 to n - Bit Algorithm - In other words, if the control goes inside while loop of getNextLeftmostBit().