# Tag - xor operation in c

## 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.

## 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.

## 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.

## 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().